default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Masarík
Tomáš Masařík
Person information
- unicode name: Tomáš Masařík
- affiliation: University of Warsaw, Poland
- affiliation (former): Simon Fraser University, BC, Canada
- affiliation (former): Charles University, Prague, Czech Republic
SPARQL queries 
🛈 Please note that only 70% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2026
[j31]Anastasia Halfpap, Bernard Lidický, Tomás Masarík
:
Proper rainbow saturation numbers for cycles. Discret. Math. 349(7): 115053 (2026)- [c27]Karolina Drabik, Tomás Masarík:
Finding Diverse Solutions Parameterized by Cliquewidth. AAAI 2026: 36864-36872 - [i54]Tomás Masarík, Michal Wlodarczyk, Mehmet Akif Yildiz:
Optimal Path Partitions in Subcubic and Almost-subcubic Graphs. CoRR abs/2602.12925 (2026) - [i53]Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski:
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes. CoRR abs/2602.18317 (2026) - 2025
- [j30]Peter Bradshaw, Tomás Masarík:
Single-conflict colorings of degenerate graphs. J. Graph Theory 109(2): 170-183 (2025) - [c26]Linda Cook, Eun Jung Kim, Tomás Masarík:
A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. PODC 2025: 110-120 - [c25]Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink:
Unbent Collections of Orthogonal Drawings. WG 2025: 18-32 - [i52]Tomás Masarík, Jedrzej Olkowski, Anna Zych-Pawlewicz:
Fair Vertex Problems Parameterized by Cluster Vertex Deletion. CoRR abs/2502.01400 (2025) - [i51]Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink:
Unbent Collections of Orthogonal Drawings. CoRR abs/2502.18390 (2025) - [i50]Sylwia Cichacz, Claire Hilaire, Tomás Masarík, Jana Masaríková, Martin Milanic:
Path Eccentricity and Forbidden Induced Subgraphs. CoRR abs/2503.15747 (2025) - [i49]Linda Cook, Eun Jung Kim, Tomás Masarík:
A Tight Meta-theorem for LOCAL Certification of MSO2 Properties within Bounded Treewidth Graphs. CoRR abs/2503.19671 (2025) - [i48]Gaspard Charvy, Tomás Masarík:
General Strong Bound on the Uncrossed Number which is Tight for the Edge Crossing Number. CoRR abs/2507.20937 (2025) - [i47]Justyna Jaworska, Bartlomiej Kielak, Tomás Masarík, Jana Masaríková:
Constricting the Computational Complexity Gap of the 4-Coloring Problem in (Pt,C3)-free Graphs. CoRR abs/2509.02423 (2025) - [i46]Édouard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Tomás Masarík:
Separator Theorem for Minor-Free Graphs in Linear Time. CoRR abs/2512.01587 (2025) - 2024
- [j29]Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38(1): 170-189 (2024) - [j28]Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory 16(2): 8:1-8:18 (2024) - [c24]Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner:
On the Uncrossed Number of Graphs. GD 2024: 18:1-18:13 - [c23]Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron:
A Generalised Theory of Proportionality in Collective Decision Making. EC 2024: 734-754 - [c22]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA 2024: 1177-1193 - [c21]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC 2024: 683-691 - [i45]Anastasia Halfpap, Bernard Lidický, Tomás Masarík:
Proper Rainbow Saturation Numbers for Cycles. CoRR abs/2403.15602 (2024) - [i44]Karolina Drabik, Tomás Masarík:
Finding Diverse Solutions Parameterized by Cliquewidth. CoRR abs/2405.20931 (2024) - [i43]Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner:
On the Uncrossed Number of Graphs. CoRR abs/2407.21206 (2024) - 2023
- [j27]Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza:
Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. Electron. J. Comb. 30(3) (2023) - [j26]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-width: Harnessing the power of atoms. J. Graph Theory 104(4): 769-810 (2023) - [j25]Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez:
The Phase Transition of Discrepancy in Random Hypergraphs. SIAM J. Discret. Math. 37(3): 1818-1841 (2023) - [c20]Petr Hlinený, Tomás Masarík:
Minimizing an Uncrossed Collection of Drawings. GD (1) 2023: 110-123 - [c19]Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza:
A tight quasi-polynomial bound for Global Label Min-Cut. SODA 2023: 290-303 - [c18]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA 2023: 3229-3244 - [i42]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR abs/2305.15738 (2023) - [i41]Petr Hlinený, Tomás Masarík:
Minimizing an Uncrossed Collection of Drawings. CoRR abs/2306.09550 (2023) - [i40]Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron:
Group Fairness in Social Choice. CoRR abs/2307.06077 (2023) - [i39]Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík:
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR abs/2312.07962 (2023) - 2022
- [j24]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - [j23]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. Algorithmica 84(6): 1526-1547 (2022) - [j22]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42(Supplement 2): 1409-1438 (2022) - [j21]Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro:
Linear Bounds for Cycle-Free Saturation Games. Electron. J. Comb. 29(3) (2022) - [j20]Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. 306: 120-132 (2022) - [j19]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j18]Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib:
On Weak Flexibility in Planar Graphs. Graphs Comb. 38(6): 180 (2022) - [j17]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory 101(4): 717-745 (2022) - [j16]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36(2): 922-938 (2022) - [j15]Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho:
Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. 36(2): 1416-1435 (2022) - [c17]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP 2022: 93:1-93:19 - [c16]Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC 2022: 30:1-30:15 - [i38]Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR abs/2202.12438 (2022) - [i37]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR abs/2203.04836 (2022) - [i36]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR abs/2207.07425 (2022) - [i35]Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza:
A tight quasi-polynomial bound for Global Label Min-Cut. CoRR abs/2207.07426 (2022) - [i34]Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza:
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4. CoRR abs/2209.06171 (2022) - [i33]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR abs/2211.01032 (2022) - 2021
- [j14]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. Algorithmica 83(12): 3649-3680 (2021) - [j13]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j12]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. J. Graph Theory 96(4): 619-641 (2021) - [j11]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35(1): 546-574 (2021) - [c15]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. SODA 2021: 1702-1719 - [c14]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. WG 2021: 388-401 - [i32]Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez:
The Phase Transition of Discrepancy in Random Hypergraphs. CoRR abs/2102.07342 (2021) - [i31]Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random 2-cell embeddings of multistars. CoRR abs/2103.05036 (2021) - [i30]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant congestion brambles in directed graphs. CoRR abs/2103.08445 (2021) - [i29]Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho:
Robust Connectivity of Graphs on Surfaces. CoRR abs/2104.12030 (2021) - [i28]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. CoRR abs/2105.09871 (2021) - [i27]Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro:
Linear Bounds for Cycle-free Saturation Games. CoRR abs/2108.05295 (2021) - [i26]Peter Bradshaw, Tomás Masarík:
Single-conflict colorings of degenerate graphs. CoRR abs/2112.06333 (2021) - 2020
- [j10]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (Pr + Ps)-Free Graphs. Algorithmica 82(7): 1833-1858 (2020) - [j9]Tomás Masarík, Tomás Toufar:
Parameterized complexity of fair deletion problems. Discret. Appl. Math. 278: 51-61 (2020) - [j8]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. Eur. J. Comb. 86: 103074 (2020) - [j7]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. J. Graph Theory 95(3): 457-466 (2020) - [j6]Jana Novotná, Milan Hladík, Tomás Masarík:
Duality Gap in Interval Linear Programming. J. Optim. Theory Appl. 184(2): 565-580 (2020) - [c13]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125 - [c12]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC 2020: 31:1-31:15 - [c11]Radek Husek, Dusan Knop, Tomás Masarík:
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC 2020: 16:1-16:18 - [c10]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS 2020: 57:1-57:14 - [c9]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. WG 2020: 119-133 - [i25]Radek Husek, Dusan Knop, Tomás Masarík:
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR abs/2002.03583 (2020) - [i24]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR abs/2002.08311 (2020) - [i23]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. CoRR abs/2003.02475 (2020) - [i22]Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR abs/2004.10917 (2020) - [i21]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. CoRR abs/2006.03578 (2020) - [i20]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR abs/2006.15837 (2020) - [i19]Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib:
On Weak Flexibility in Planar Graphs. CoRR abs/2009.07932 (2020) - [i18]Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
Note on 3-Coloring of (2P4, C5)-Free Graphs. CoRR abs/2011.06173 (2020)
2010 – 2019
- 2019
- [j5]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12(12): 254 (2019) - [j4]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. J. Graph Theory 90(3): 443-454 (2019) - [j3]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15(4) (2019) - [c8]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. ESA 2019: 72:1-72:13 - [c7]Dusan Knop, Tomás Masarík, Tomás Toufar:
Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS 2019: 33:1-33:16 - [i17]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. CoRR abs/1902.02971 (2019) - [i16]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. CoRR abs/1902.04069 (2019) - [i15]Tomás Masarík:
Flexibility of planar graphs without 4-cycles. CoRR abs/1903.01460 (2019) - [i14]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - [i13]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing directed circuits quarter-integrally. CoRR abs/1907.02494 (2019) - [i12]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR abs/1911.05032 (2019) - [i11]Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in subcubic graphs. CoRR abs/1912.01570 (2019) - 2018
- [j2]Dusan Knop, Tomás Masarík:
Computational complexity of distance edge labeling. Discret. Appl. Math. 246: 80-98 (2018) - [j1]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. Inf. Process. Lett. 137: 6-10 (2018) - [c6]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. ISAAC 2018: 5:1-5:13 - [c5]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15 - [i10]Jana Novotná, Milan Hladík, Tomás Masarík:
Duality Gap in Interval Linear Programming. CoRR abs/1802.05795 (2018) - [i9]Dusan Knop, Tomás Masarík, Tomás Toufar:
Parameterized complexity of fair deletion problems II. CoRR abs/1803.06878 (2018) - [i8]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. CoRR abs/1803.08641 (2018) - [i7]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. CoRR abs/1804.11091 (2018) - 2017
- [c4]Tomás Masarík, Tomás Toufar:
Parameterized Complexity of Fair Deletion Problems. TAMC 2017: 628-642 - [c3]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG 2017: 344-357 - [i6]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR abs/1703.00544 (2017) - [i5]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR abs/1710.00668 (2017) - [i4]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. CoRR abs/1712.08373 (2017) - 2016
- [c2]Pavel Dvorák, Dusan Knop, Tomás Masarík:
Anti-Path Cover on Sparse Graph Classes. MEMICS 2016: 82-86 - [i3]Tomás Masarík, Tomas Toufar:
Parameterized complexity of fair deletion problems. CoRR abs/1605.07959 (2016) - [i2]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. CoRR abs/1606.06265 (2016) - 2015
- [c1]Dusan Knop, Tomás Masarík:
Computational Complexity of Distance Edge Labeling. IWOCA 2015: 287-298 - [i1]Dusan Knop, Tomás Masarík:
Computational complexity of distance edge labeling. CoRR abs/1508.01014 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-31 00:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
