Danil Paulusma
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
132
Venues
25
Active years
2003–2026
Best venue rank
A*
Where they publish
- BWG33 papers
- BMFCS18 papers
- BISAAC16 papers
- CIWOCA9 papers
- CCIAC7 papers
- BFCT7 papers
- NationalCSR7 papers
- ASTACS5 papers
- AESA5 papers
- BWADS3 papers
- CTAMC3 papers
- BSOFSEM3 papers
- CCiE2 papers
- BLATIN2 papers
- NationalCOCOON2 papers
- BWALCOM1 paper
- BCPM1 paper
- BSAGT1 paper
- CLATA1 paper
- CAAIM1 paper
- CCOCOA1 paper
- ACP1 paper
- ASAT1 paper
- BSIROCCO1 paper
- A*ICALP1 paper
Papers
132 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STACS | Colouring Probe H-Free Graphs. | Danil Paulusma, Johannes Rauch, Erik Jan van Leeuwen |
| 2026 | WG | Optimal b-Colourings and Fall Colourings in H-Free Graphs. | Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza-Granada, Danil Paulusma |
| 2026 | WG | Graph Classes Closed Under Self-Intersection. | Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Danil Paulusma, Viktor Zamaraev |
| 2026 | WG | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. | Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Danil Paulusma |
| 2025 | CIAC | Atoms Versus Avoiding Simplicial Vertices. | Karl Boddy, Konrad K. Dabrowski, Danil Paulusma |
| 2025 | FCT | Finding d-Cuts in Probe H-Free Graphs. | Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2025 | ISAAC | Finding d-Cuts in Claw-Free Graphs. | Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Danil Paulusma, Siani Smith |
| 2025 | WG | Non-crossing H-Graphs: A Generalization of Proper Interval Graphs Admitting FPT Algorithms. | Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Danil Paulusma |
| 2025 | WG | Bounding Width on Graph Classes of Constant Diameter. | Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2024 | CiE | Graph Homomorphism, Monotone Classes and Bounded Pathwidth. | Tala Eagling-Vose, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2024 | ISAAC | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. | Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | IWOCA | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. | Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2024 | WG | Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. | Felicia Lucke, Ali Momeni, Danil Paulusma, Siani Smith |
| 2024 | WG | The Complexity of Diameter on H-free Graphs. | Jelle J. Oostveen, Danil Paulusma, Erik Jan van Leeuwen |
| 2023 | FCT | Computing Subset Vertex Covers in H-Free Graphs. | Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Erik Jan van Leeuwen |
| 2023 | ISAAC | Matching Cuts in Graphs of High Girth and H-Free Graphs. | Carl Feghali, Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2023 | MFCS | Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. | Matthew Johnson, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2023 | MFCS | Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. | Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2022 | ISAAC | Finding Matching Cuts in H-Free Graphs. | Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2022 | WALCOM | The Complexity of L(p, q)-Edge-Labelling. | Gatan Berthe, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2022 | WG | An Algorithmic Framework for Locally Constrained Homomorphisms. | Laurent Bulteau, Konrad K. Dabrowski, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2022 | WG | Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2022 | WG | Classifying Subset Feedback Vertex Set for H-Free Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2021 | CIAC | Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. | Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | CSR | Injective Colouring for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | ESA | QCSP on Reflexive Tournaments. | Benot Larose, Petar Markovic, Barnaby Martin, Danil Paulusma, Siani Smith, Stanislav Zivn |
| 2021 | ISAAC | Partitioning H-Free Graphs of Bounded Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | IWOCA | Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Walter Kern, Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | MFCS | Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2021 | WADS | Solving Problems on Generalized Convex Graphs via Mim-Width. | Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Danil Paulusma |
| 2021 | WADS | Computing Weighted Subset Transversals in H-Free Graphs. | Nick Brettell, Matthew Johnson, Danil Paulusma |
| 2021 | WG | Acyclic, Star, and Injective Colouring: Bounding the Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2020 | ESA | Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2020 | ISAAC | Contracting to a Longest Path in H-Free Graphs. | Walter Kern, Danil Paulusma |
| 2020 | LATIN | Steiner Trees for Hereditary Graph Classes. | Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Erik Jan van Leeuwen |
| 2020 | WG | Computing Subset Transversals in H-Free Graphs. | Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2020 | WG | Clique-Width: Harnessing the Power of Atoms. | Konrad K. Dabrowski, Toms Masark, Jana Novotn, Danil Paulusma, Pawel Rzazewski |
| 2019 | CPM | Finding a Small Number of Colourful Components. | Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Danil Paulusma, Stphane Vialette |
| 2019 | FCT | On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. | Carl Feghali, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2019 | MFCS | Colouring H-Free Graphs of Bounded Diameter. | Barnaby Martin, Danil Paulusma, Siani Smith |
| 2019 | WADS | Graph Isomorphism for (H | Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Danil Paulusma |
| 2018 | ESA | Disconnected Cuts in Claw-free Graphs. | Barnaby Martin, Danil Paulusma, Erik Jan van Leeuwen |
| 2018 | ISAAC | Colouring (P_r+P_s)-Free Graphs. | Tereza Klimosov, Josef Malk, Toms Masark, Jana Novotn, Danil Paulusma, Veronika Slvov |
| 2018 | MFCS | On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. | Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Viktor Zamaraev |
| 2018 | STACS | Colouring Square-Free Graphs without Long Induced Paths. | Serge Gaspers, Shenwei Huang, Danil Paulusma |
| 2018 | STACS | Surjective H-Colouring over Reflexive Digraphs. | Benot Larose, Barnaby Martin, Danil Paulusma |
| 2018 | SAGT | Simple Games Versus Weighted Voting Games. | Frits Hof, Walter Kern, Sascha Kurz, Danil Paulusma |
| 2018 | WG | Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. | Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2018 | WG | Computing Small Pivot-Minors. | Konrad K. Dabrowski, Franois Dross, Jisu Jeong, Mamadou Moustapha Kant, O-joung Kwon, Sang-il Oum, Danil Paulusma |
| 2017 | CiE | Surjective H-Colouring: New Hardness Results. | Petr A. Golovach, Matthew Johnson, Barnaby Martin, Danil Paulusma, Anthony Stewart |
| 2017 | ISAAC | Independent Feedback Vertex Set for P_5-free Graphs. | Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Danil Paulusma |
| 2017 | MFCS | Clique-Width for Graph Classes Closed under Complementation. | Alexandre Blanch, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Danil Paulusma, Viktor Zamaraev |
| 2017 | MFCS | Recognizing Graphs Close to Bipartite Graphs. | Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Danil Paulusma |
| 2017 | TAMC | Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. | Danil Paulusma, Christophe Picouleau, Bernard Ries |
| 2017 | WG | Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma |
| 2017 | WG | Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Danil Paulusma |
| 2016 | IWOCA | Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma |
| 2016 | IWOCA | Finding Cactus Roots in Polynomial Time. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma, Anthony Stewart |
| 2016 | MFCS | Using Contracted Solution Graphs for Solving Reconfiguration Problems. | Paul S. Bonsma, Danil Paulusma |
| 2015 | CIAC | Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. | Konrad K. Dabrowski, Danil Paulusma |
| 2015 | CIAC | Contraction Blockers for Graphs with Forbidden Induced Paths. | znur Yasar Diner, Danil Paulusma, Christophe Picouleau, Bernard Ries |
| 2015 | CSR | Editing to a Planar Graph of Given Degrees. | Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Danil Paulusma, Dimitrios M. Thilikos |
| 2015 | FCT | Minimal Disconnected Cuts in Planar Graphs. | Marcin Kaminski, Danil Paulusma, Anthony Stewart, Dimitrios M. Thilikos |
| 2015 | IWOCA | Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. | Konrad Kazimierz Dabrowski, Franois Dross, Matthew Johnson, Danil Paulusma |
| 2015 | LATA | Bounding Clique-Width via Perfect Graphs. | Konrad Kazimierz Dabrowski, Shenwei Huang, Danil Paulusma |
| 2015 | MFCS | Bounding the Clique-Width of H-free Chordal Graphs. | Andreas Brandstdt, Konrad K. Dabrowski, Shenwei Huang, Danil Paulusma |
| 2015 | MFCS | The Price of Connectivity for Cycle Transversals. | Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Danil Paulusma |
| 2015 | WG | The Stable Fixtures Problem with Payments. | Pter Bir, Walter Kern, Danil Paulusma, Pter Wojuteczky |
| 2015 | WG | Open Problems on Graph Coloring for Special Graph Classes. | Danil Paulusma |
| 2014 | AAIM | Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. | Shenwei Huang, Matthew Johnson, Danil Paulusma |
| 2014 | COCOON | Classifying the Clique-Width of H-Free Bipartite Graphs. | Konrad Kazimierz Dabrowski, Danil Paulusma |
| 2014 | MFCS | Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. | Rmy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Danil Paulusma |
| 2014 | MFCS | A Reconfigurations Analogue of Brooks' Theorem. | Carl Feghali, Matthew Johnson, Danil Paulusma |
| 2014 | MFCS | Knocking Out P k -free Graphs. | Matthew Johnson, Danil Paulusma, Anthony Stewart |
| 2014 | WG | Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2013 | CIAC | List Coloring in the Absence of Two Subgraphs. | Petr A. Golovach, Danil Paulusma |
| 2013 | FCT | Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. | Steven Chaplick, Jir Fiala, Pim van 't Hof, Danil Paulusma, Marek Tesar |
| 2013 | ISAAC | Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. | Matthew Johnson, Danil Paulusma, Erik Jan van Leeuwen |
| 2013 | IWOCA | Graph Editing to a Fixed Target. | Petr A. Golovach, Danil Paulusma, Iain A. Stewart |
| 2013 | STACS | Model Counting for CNF Formulas of Bounded Modular Treewidth. | Danil Paulusma, Friedrich Slivovsky, Stefan Szeider |
| 2013 | WG | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. | Hajo Broersma, Jir Fiala, Petr A. Golovach, Toms Kaiser, Danil Paulusma, Andrzej Proskurowski |
| 2013 | WG | Sparse Square Roots. | Manfred Cochefert, Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2013 | WG | Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. | Konrad K. Dabrowski, Petr A. Golovach, Danil Paulusma |
| 2012 | COCOA | Characterizing Graphs of Small Carving-Width. | Rmy Belmonte, Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2012 | CSR | Finding Vertex-Surjective Graph Homomorphisms. | Petr A. Golovach, Bernard Lidick, Barnaby Martin, Danil Paulusma |
| 2012 | ESA | Induced Disjoint Paths in Claw-Free Graphs. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2012 | ISAAC | Detecting Induced Minors in AT-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2012 | ISAAC | Closing Complexity Gaps for Coloring Problems on H-Free Graphs. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2012 | MFCS | Obtaining Planarity by Contracting Few Edges. | Petr A. Golovach, Pim van 't Hof, Danil Paulusma |
| 2012 | MFCS | Coloring Graphs Characterized by a Forbidden Subgraph. | Petr A. Golovach, Danil Paulusma, Bernard Ries |
| 2012 | SOFSEM | 4-Coloring H-Free Graphs When H Is Small. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2012 | WG | Solutions for the Stable Roommates Problem with Payments. | Pter Bir, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Danil Paulusma |
| 2012 | WG | How to Eliminate a Graph. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, Michal Pilipczuk |
| 2011 | CP | The Computational Complexity of Disconnected Cut and 2K 2-Partition. | Barnaby Martin, Danil Paulusma |
| 2011 | CSR | Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2011 | FCT | Coloring Graphs without Short Cycles and Long Induced Paths. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2011 | ISAAC | Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. | Rmy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2011 | MFCS | Contracting a Chordal Graph to a Split Graph or a Tree. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma |
| 2011 | SAT | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). | Sebastian Ordyniak, Danil Paulusma, Stefan Szeider |
| 2011 | WG | List Coloring in the Absence of a Linear Forest. | Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2010 | CIAC | Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. | Jrmie Chalopin, Danil Paulusma |
| 2010 | CSR | Obtaining Online Ecological Colourings by Generalizing First-Fit. | Matthew Johnson, Viresh Patel, Danil Paulusma, Thophile Trunck |
| 2010 | ESA | Contractions of Planar Graphs in Polynomial Time. | Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2010 | ISAAC | On Coloring Graphs without Induced Forests. | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2010 | IWOCA | Computing Role Assignments of Proper Interval Graphs in Polynomial Time. | Pinar Heggernes, Pim van 't Hof, Danil Paulusma |
| 2010 | STACS | The k-in-a-path Problem for Claw-free Graphs. | Jir Fiala, Marcin Kaminski, Bernard Lidick, Danil Paulusma |
| 2010 | SOFSEM | On Contracting Graphs to Fixed Pattern Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
| 2010 | TAMC | On Solution Concepts for Matching Games. | Pter Bir, Walter Kern, Danil Paulusma |
| 2010 | TAMC | Untitled record | Petr A. Golovach, Bernard Lidick, Danil Paulusma |
| 2010 | WG | Narrowing Down the Gap on the Complexity of Coloring | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2009 | CSR | Partitioning Graphs into Connected Parts. | Pim van 't Hof, Danil Paulusma, Gerhard J. Woeginger |
| 2009 | FCT | Computing Role Assignments of Chordal Graphs. | Pim van 't Hof, Danil Paulusma, Johan M. M. van Rooij |
| 2009 | ISAAC | Induced Packing of Odd Cycles in a Planar Graph. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | ISAAC | Parameterizing Cut Sets in a Graph by the Number of Their Components. | Takehiro Ito, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | ISAAC | On Partitioning a Graph into Two Connected Subgraphs. | Danil Paulusma, Johan M. M. van Rooij |
| 2009 | IWOCA | Three Complexity Results on Coloring | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Danil Paulusma |
| 2009 | WG | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Danil Paulusma |
| 2009 | WG | Finding Induced Paths of Given Parity in Claw-Free Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2008 | COCOON | A New Characterization of P6-Free Graphs. | Pim van 't Hof, Danil Paulusma |
| 2008 | CSR | Comparing Universal Covers in Polynomial Time. | Jir Fiala, Danil Paulusma |
| 2008 | IWOCA | Path factors and parallel knock-out schemes of almost claw-free graphs. | Matthew Johnson, Danil Paulusma, Chantal Wood |
| 2008 | MFCS | Computing Sharp 2-Factors in Claw-Free Graphs. | Hajo Broersma, Danil Paulusma |
| 2007 | SIROCCO | Upper Bounds and Algorithms for Parallel Knock-Out Numbers. | Hajo Broersma, Matthew Johnson, Danil Paulusma |
| 2007 | SOFSEM | Improved Upper Bounds for | Hajo Broersma, Bert Marchal, Danil Paulusma, A. N. M. Salman |
| 2006 | CIAC | On-Line Coloring of H-Free Bipartite Graphs. | Hajo Broersma, Agostino Capponi, Danil Paulusma |
| 2006 | LATIN | The Computational Complexity of the Parallel Knock-Out Problem. | Hajo Broersma, Matthew Johnson, Danil Paulusma, Iain A. Stewart |
| 2006 | WG | Graph Labelings Derived from Models in Distributed Computing. | Jrmie Chalopin, Danil Paulusma |
| 2005 | MFCS | Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2005 | WG | Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2004 | WG | The Computational Complexity of the Minimum Weight Processor Assignment Problem. | Hajo Broersma, Danil Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
| 2003 | ICALP | The Computational Complexity of the Role Assignment Problem. | Jir Fiala, Danil Paulusma |
| 2003 | WG | The Complexity of Graph Contractions. | Asaf Levin, Danil Paulusma, Gerhard J. Woeginger |