Masařík, Tomáš

1. Optimal Discretization is Fixed-parameter Tractable
   2020/03/05 by Kratsch, Stefan, Masařík, Tomáš, Muzi, Irene +2 · 2 citations
   #68Q25 #68R01 #68W40 #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
   2023/05/25 by Gartland, Peter, Lokshtanov, Daniel, Masařík, Tomáš +3 · 3 citations
   #05C69 #05C85 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.2
3. A Generalised Theory of Proportionality in Collective Decision Making
   2023/07/12 by Tomáš Masařík, Masařík, Tomáš, Grzegorz Pierczyński +3 · 3 citations
   Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Voting Systems #Multiagent Systems (cs.MA)
4. Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
   2023/12/13 by Édouard Bonnet, Jędrzej Hodor, Bonnet, Édouard +5 · 3 citations
   Computer Science · Mathematics · #05C83 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
5. Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
   2022/03/09 by Majewski, Konrad, Masařík, Tomáš, Novotná, Jana +4 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
6. Clique-Width: Harnessing the Power of Atoms
   2020/06/05 by Dabrowski, Konrad K., Masařík, Tomáš, Novotná, Jana +2 · 1 citation
   #05C75 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
7. Finding Diverse Solutions Parameterized by Cliquewidth
   2024/05/31 by Drabik, Karolina, Masařík, Tomáš · 1 citation
   #05C85 #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences
8. Minimizing an Uncrossed Collection of Drawings
   2023/06/15 by Petr Hliněný, Tomáš Masařík, Hliněný, Petr +1 · 1 citation
   Computer Science · #68R10 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Visualization and Analytics #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Theory and Algorithms
9. A Tight Meta-theorem for LOCAL Certification of MSO₂ Properties within Bounded Treewidth Graphs
   2025/03/25 by Cook, Linda, Kim, Eun Jung, Masařík, Tomáš · 1 citation
   #68R10 #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed #F.2.2 #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)