Toms Masark
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
27
Venues
14
Active years
2015–2026
Best venue rank
A*
Where they publish
Papers
27 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Finding Diverse Solutions Parameterized by Cliquewidth. | Karolina Drabik, Toms Masark |
| 2026 | ESA | Tree-Independence Number of P₅-Free Graphs with No Large Bicliques. | Vclav Blazej, Jochen Pascal Gollin, Toms Hons, Toms Masark, Martin Milanic, Pawel Rzazewski, Ondrej Such, Alexandra Wesolek |
| 2026 | STOC | Separator Theorem for Minor-Free Graphs in Linear Time. | douard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Toms Masark |
| 2026 | WG | Optimal Path Partitions in Subcubic and Almost-Subcubic Graphs. | Toms Masark, Michal Wlodarczyk, Mehmet Akif Yildiz |
| 2025 | PODC | A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. | Linda Cook, Eun Jung Kim, Toms Masark |
| 2025 | WG | Unbent Collections of Orthogonal Drawings. | Todor Antic, Giuseppe Liotta, Toms Masark, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink |
| 2024 | GD | On the Uncrossed Number of Graphs. | Martin Balko, Petr Hlinen, Toms Masark, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner |
| 2024 | SODA | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. | Jesse Campion Loth, Kevin Halasz, Toms Masark, Bojan Mohar, Robert Smal |
| 2024 | STOC | Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov, Toms Masark, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2023 | GD | Minimizing an Uncrossed Collection of Drawings. | Petr Hlinen, Toms Masark |
| 2023 | SODA | Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. | Meike Hatzel, Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2023 | SODA | A tight quasi-polynomial bound for Global Label Min-Cut. | Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Uverton S. Souza |
| 2022 | ICALP | Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyrfs' Path Argument. | Konrad Majewski, Toms Masark, Jana Novotn, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski |
| 2022 | ISAAC | List Locally Surjective Homomorphisms in Hereditary Graph Classes. | Pavel Dvork, Toms Masark, Jana Novotn, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk |
| 2021 | SODA | Optimal Discretization is Fixed-parameter Tractable. | Stefan Kratsch, Toms Masark, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2021 | WG | On 3-Coloring of (2P | Vt Jelnek, Tereza Klimosov, Toms Masark, Jana Novotn, Aneta Pokorn |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2020 | ISAAC | Flexible List Colorings in Graphs with Special Degeneracy Conditions. | Peter Bradshaw, Toms Masark, Ladislav Stacho |
| 2020 | MFCS | U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. | Jan Kratochvl, Toms Masark, Jana Novotn |
| 2020 | WG | Clique-Width: Harnessing the Power of Atoms. | Konrad K. Dabrowski, Toms Masark, Jana Novotn, Danil Paulusma, Pawel Rzazewski |
| 2019 | ESA | Packing Directed Circuits Quarter-Integrally. | Toms Masark, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge |
| 2019 | MFCS | Parameterized Complexity of Fair Vertex Evaluation Problems. | Dusan Knop, Toms Masark, Toms Toufar |
| 2018 | ISAAC | Colouring (P_r+P_s)-Free Graphs. | Tereza Klimosov, Josef Malk, Toms Masark, Jana Novotn, Danil Paulusma, Veronika Slvov |
| 2018 | STACS | Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. | Pavel Dvork, Andreas Emil Feldmann, Dusan Knop, Toms Masark, Tomas Toufar, Pavel Vesel |
| 2017 | TAMC | Parameterized Complexity of Fair Deletion Problems. | Toms Masark, Toms Toufar |
| 2017 | WG | Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. | Dusan Knop, Martin Kouteck, Toms Masark, Toms Toufar |
| 2015 | IWOCA | Computational Complexity of Distance Edge Labeling. | Dusan Knop, Toms Masark |