| Publication | Date of Publication | Type |
|---|
| On the price of independence for vertex cover, feedback vertex set and odd cycle transversal | 2024-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147518 | 2024-01-15 | Paper |
| Solving problems on generalized convex graphs via mim-width | 2024-01-04 | Paper |
| Maximizing Matching Cuts | 2023-12-20 | Paper |
| The complexity of \(L(p, q)\)-edge-labelling | 2023-11-17 | Paper |
| Contracting to a longest path in H-free graphs | 2023-11-14 | Paper |
| Bounding the Mim-Width of Hereditary Graph Classes. | 2023-11-13 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
| Clique‐width: Harnessing the power of atoms | 2023-11-06 | Paper |
| Finding matching cuts in \(H\)-free graphs | 2023-10-06 | Paper |
| Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration | 2023-10-04 | Paper |
| Bounding the mim‐width of hereditary graph classes | 2023-10-04 | Paper |
| Induced disjoint paths and connected subgraphs for \(H\)-free graphs | 2023-09-27 | Paper |
| QCSP on Reflexive Tournaments | 2023-09-20 | Paper |
| Comparing Width Parameters on Graph Classes | 2023-08-10 | Paper |
| Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs | 2023-08-08 | Paper |
| Few induced disjoint paths for \(H\)-free graphs | 2023-08-03 | Paper |
| Computing Subset Vertex Covers in $H$-Free Graphs | 2023-07-11 | Paper |
| An algorithmic framework for locally constrained homomorphisms | 2023-05-05 | Paper |
| Induced disjoint paths and connected subgraphs for \(H\)-free graphs | 2023-05-05 | Paper |
| Classifying subset feedback vertex set for \(H\)-free graphs | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs | 2023-05-01 | Paper |
| Colouring graphs of bounded diameter in the absence of small cycles | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874489 | 2023-02-07 | Paper |
| Matching Cuts in Graphs of High Girth and H-Free Graphs | 2022-12-23 | Paper |
| Clique-width: harnessing the power of atoms | 2022-12-21 | Paper |
| Computing subset transversals in \(H\)-free graphs | 2022-12-21 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| Complexity Framework For Forbidden Subgraphs I: The Framework | 2022-11-23 | Paper |
| Few induced disjoint paths for \(H\)-free graphs | 2022-11-17 | Paper |
| On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs | 2022-10-21 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
| Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs | 2022-10-06 | Paper |
| Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter | 2022-09-01 | Paper |
| Partitioning \(H\)-free graphs of bounded diameter | 2022-08-25 | Paper |
| Colouring (P_r+P_s)-Free Graphs | 2022-07-21 | Paper |
| Colouring H-free graphs of bounded diameter. | 2022-07-21 | Paper |
| Finding a Small Number of Colourful Components | 2022-07-18 | Paper |
| The complexity of \(L(p, q)\)-edge-labelling | 2022-07-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-08 | Paper |
| Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs | 2022-05-16 | Paper |
| Colouring graphs of bounded diameter in the absence of small cycles | 2022-04-20 | Paper |
| On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs | 2022-04-14 | Paper |
| Solving problems on generalized convex graphs via mim-width | 2022-03-25 | Paper |
| Computing weighted subset transversals in \(H\)-free graphs | 2022-03-25 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2022-03-22 | Paper |
| Injective colouring for H-free graphs | 2022-03-21 | Paper |
| Few Induced Disjoint Paths for $H$-Free Graphs | 2022-03-07 | Paper |
| What Graphs are 2-Dot Product Graphs? | 2022-02-01 | Paper |
| Computing subset transversals in \(H\)-free graphs | 2022-01-18 | Paper |
| Tree Pivot-Minors and Linear Rank-Width | 2022-01-07 | Paper |
| Hard problems that quickly become very easy | 2021-12-14 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2021-12-01 | Paper |
| Induced disjoint paths in AT-free graphs | 2021-11-25 | Paper |
| Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter | 2021-11-23 | Paper |
| List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective | 2021-10-19 | Paper |
| In memoriam Walter Kern | 2021-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005166 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009627 | 2021-08-04 | Paper |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs | 2021-05-13 | Paper |
| Partitioning H-Free Graphs of Bounded Diameter | 2021-05-10 | Paper |
| Acyclic, Star, and Injective Colouring: Bounding the Diameter | 2021-04-21 | Paper |
| Steiner trees for hereditary graph classes: a treewidth perspective | 2021-04-15 | Paper |
| Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy | 2021-04-08 | Paper |
| Clique-width for hereditary graph classes | 2021-02-06 | Paper |
| Independent Feedback Vertex Set for P_5-free Graphs | 2020-11-25 | Paper |
| On cycle transversals and their connected variants in the absence of a small linear forest | 2020-10-12 | Paper |
| Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs | 2020-08-21 | Paper |
| Colouring square-free graphs without long induced paths. | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304148 | 2020-08-05 | Paper |
| Computing Weighted Subset Transversals in $H$-Free Graphs | 2020-07-28 | Paper |
| Filling the complexity gaps for colouring planar and bounded degree graphs | 2020-07-17 | Paper |
| Disconnected cuts in claw-free graphs | 2020-06-09 | Paper |
| Clique-Width for Graph Classes Closed under Complementation | 2020-06-09 | Paper |
| Clique-Width: Harnessing the Power of Atoms | 2020-06-05 | Paper |
| Computing Subset Transversals in $H$-Free Graphs | 2020-05-28 | Paper |
| Recognizing Graphs Close to Bipartite Graphs | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111290 | 2020-05-26 | Paper |
| Colouring \((P_r + P_s)\)-free graphs | 2020-05-21 | Paper |
| Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective | 2020-04-10 | Paper |
| Simple games versus weighted voting games: bounding the critical threshold value | 2020-04-08 | Paper |
| On cycle transversals and their connected variants in the absence of a small linear forest | 2020-01-30 | Paper |
| Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy | 2020-01-16 | Paper |
| Connected vertex cover for \((sP_1+P_5)\)-free graphs | 2020-01-16 | Paper |
| Surjective H-Colouring over Reflexive Digraphs | 2019-12-16 | Paper |
| Clique-width and well-quasi-ordering of triangle-free graph classes | 2019-11-29 | Paper |
| Surjective H-colouring: New hardness results | 2019-10-28 | Paper |
| Using contracted solution graphs for solving reconfiguration problems | 2019-10-17 | Paper |
| On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal | 2019-10-11 | Paper |
| Colouring square-free graphs without long induced paths | 2019-08-30 | Paper |
| Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide | 2019-08-15 | Paper |
| On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest | 2019-08-01 | Paper |
| Bounding clique-width via perfect graphs | 2019-06-25 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2019-05-21 | Paper |
| Classifying \(k\)-edge colouring for \(H\)-free graphs | 2019-04-26 | Paper |
| Independent feedback vertex set for \(P_5\)-free graphs | 2019-04-25 | Paper |
| Critical vertices and edges in \(H\)-free graphs | 2019-03-11 | Paper |
| On the parameterized complexity of \((k,s)\)-SAT | 2019-01-18 | Paper |
| On the Parameterized Complexity of $k$-Edge Colouring | 2019-01-07 | Paper |
| Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy | 2018-11-29 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
| Connected vertex cover for \((sP_1+P_5)\)-free graphs | 2018-11-22 | Paper |
| Simple games versus weighted voting games | 2018-11-08 | Paper |
| Contraction and deletion blockers for perfect graphs and \(H\)-free graphs | 2018-09-27 | Paper |
| Computing square roots of graphs with low maximum degree | 2018-09-17 | Paper |
| Finding cactus roots in polynomial time | 2018-08-03 | Paper |
| Well-quasi-ordering versus clique-width: new results on bigenic classes | 2018-07-27 | Paper |
| The stable fixtures problem with payments | 2018-07-12 | Paper |
| Minimal disconnected cuts in planar graphs | 2018-05-23 | Paper |
| Reducing the chromatic number by vertex or edge deletions | 2018-04-09 | Paper |
| On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs | 2018-04-04 | Paper |
| Using contracted solution graphs for solving reconfiguration problems. | 2018-03-21 | Paper |
| Disconnected Cuts in Claw-free Graphs | 2018-03-09 | Paper |
| Contracting bipartite graphs to paths and cycles | 2018-01-18 | Paper |
| Clique-width and well-quasi-ordering of triangle-free graph classes | 2018-01-04 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2018-01-04 | Paper |
| Independent feedback vertex sets for graphs of bounded diameter | 2017-12-13 | Paper |
| Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity | 2017-11-16 | Paper |
| Obtaining online ecological colourings by generalizing first-fit | 2017-11-07 | Paper |
| A Linear Kernel for Finding Square Roots of Almost Planar Graphs | 2017-10-17 | Paper |
| Colouring Diamond-free Graphs. | 2017-10-17 | Paper |
| Bounding the Clique‐Width of H‐Free Chordal Graphs | 2017-09-26 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-09-07 | Paper |
| Colouring diamond-free graphs | 2017-09-07 | Paper |
| Contracting bipartite graphs to paths and cycles | 2017-08-16 | Paper |
| Surjective \(H\)-colouring: new hardness results | 2017-08-04 | Paper |
| Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978505 | 2017-04-25 | Paper |
| A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs | 2017-04-21 | Paper |
| The price of connectivity for feedback vertex set | 2017-03-15 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
| Model Counting for CNF Formulas of Bounded Modular Treewidth | 2017-01-30 | Paper |
| Editing to a planar graph of given degrees | 2016-12-28 | Paper |
| Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions | 2016-11-30 | Paper |
| Graph editing to a fixed target | 2016-11-24 | Paper |
| A Reconfigurations Analogue of Brooks' Theorem and Its Consequences | 2016-11-17 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-11-02 | Paper |
| Model counting for CNF formulas of bounded modular treewidth | 2016-11-01 | Paper |
| Open Problems on Graph Coloring for Special Graph Classes | 2016-10-21 | Paper |
| The Stable Fixtures Problem with Payments | 2016-10-21 | Paper |
| What graphs are 2-dot product graphs? | 2016-10-14 | Paper |
| Kempe equivalence of colourings of cubic graphs | 2016-10-14 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-10-14 | Paper |
| Kempe equivalence of colourings of cubic graphs | 2016-10-12 | Paper |
| Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes | 2016-09-29 | Paper |
| Finding Cactus Roots in Polynomial Time | 2016-09-29 | Paper |
| Finding shortest paths between graph colourings | 2016-09-07 | Paper |
| The price of connectivity for cycle transversals | 2016-08-16 | Paper |
| Induced disjoint paths in circular-arc graphs in linear time | 2016-07-05 | Paper |
| Bounding Clique-Width via Perfect Graphs | 2016-04-08 | Paper |
| Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs | 2016-04-04 | Paper |
| Parameterized algorithms for finding square roots | 2016-03-29 | Paper |
| New Bounds for the Snake-in-the-Box Problem | 2016-03-01 | Paper |
| Classifying the clique-width of \(H\)-free bipartite graphs | 2016-01-21 | Paper |
| Editing to Eulerian graphs | 2015-12-11 | Paper |
| Editing to a Planar Graph of Given Degrees | 2015-10-20 | Paper |
| Minimal Disconnected Cuts in Planar Graphs | 2015-09-29 | Paper |
| Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs | 2015-09-21 | Paper |
| Contraction Blockers for Graphs with Forbidden Induced Paths | 2015-09-21 | Paper |
| Bounding the Clique-Width of H-free Chordal Graphs | 2015-09-16 | Paper |
| The Price of Connectivity for Cycle Transversals | 2015-09-16 | Paper |
| Finding Shortest Paths Between Graph Colourings | 2015-09-15 | Paper |
| Induced Disjoint Paths in Circular-Arc Graphs in Linear Time | 2015-09-09 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| Knocking out \(P_k\)-free graphs | 2015-07-06 | Paper |
| Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree | 2015-06-10 | Paper |
| Modifying a graph using vertex elimination | 2015-05-21 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2015-05-20 | Paper |
| Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs | 2015-05-20 | Paper |
| The computational complexity of disconnected cut and \(2 K_2\)-partition | 2015-03-05 | Paper |
| List coloring in the absence of a linear forest | 2015-03-02 | Paper |
| Coloring graphs characterized by a forbidden subgraph | 2014-11-28 | Paper |
| Parameterized complexity of three edge contraction problems with degree constraints | 2014-11-14 | Paper |
| Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set | 2014-10-14 | Paper |
| A Reconfigurations Analogue of Brooks’ Theorem | 2014-10-14 | Paper |
| Knocking Out P k -free Graphs | 2014-10-14 | Paper |
| Classifying the Clique-Width of H-Free Bipartite Graphs | 2014-09-26 | Paper |
| Lift-contractions | 2014-07-29 | Paper |
| Closing complexity gaps for coloring problems on \(H\)-free graphs | 2014-07-18 | Paper |
| Detecting fixed patterns in chordal graphs in polynomial time | 2014-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419953 | 2014-06-11 | Paper |
| Solutions for the stable roommates problem with payments | 2014-06-06 | Paper |
| Characterizing graphs of small carving-width | 2014-04-22 | Paper |
| Packing bipartite graphs with covers of complete bipartite graphs | 2014-04-02 | Paper |
| Coloring graphs without short cycles and long induced paths | 2014-03-27 | Paper |
| Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs | 2014-02-25 | Paper |
| List coloring in the absence of two subgraphs | 2014-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747399 | 2014-02-14 | Paper |
| Colouring of graphs with Ramsey-type forbidden subgraphs | 2014-01-24 | Paper |
| Graph Editing to a Fixed Target | 2014-01-17 | Paper |
| Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs | 2014-01-14 | Paper |
| Detecting induced minors in AT-free graphs | 2014-01-09 | Paper |
| Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints | 2013-12-10 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Sparse Square Roots | 2013-12-06 | Paper |
| Colouring of Graphs with Ramsey-Type Forbidden Subgraphs | 2013-12-06 | Paper |
| Increasing the minimum degree of a graph by contractions | 2013-11-29 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2013-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857338 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857379 | 2013-11-01 | Paper |
| Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree | 2013-08-16 | Paper |
| Detecting induced star-like minors in polynomial time | 2013-06-24 | Paper |
| List Coloring in the Absence of Two Subgraphs | 2013-06-07 | Paper |
| Obtaining planarity by contracting few edges | 2013-04-17 | Paper |
| Closing Complexity Gaps for Coloring Problems on H-Free Graphs | 2013-03-21 | Paper |
| Detecting Induced Minors in AT-Free Graphs | 2013-03-21 | Paper |
| Choosability on \(H\)-free graphs | 2013-03-20 | Paper |
| Exact algorithms for finding longest cycles in claw-free graphs | 2013-03-05 | Paper |
| Three complexity results on coloring \(P_k\)-free graphs | 2013-01-24 | Paper |
| 4-coloring \(H\)-free graphs when \(H\) is small | 2012-11-22 | Paper |
| Solutions for the Stable Roommates Problem with Payments | 2012-11-06 | Paper |
| How to Eliminate a Graph | 2012-11-06 | Paper |
| Characterizing Graphs of Small Carving-Width | 2012-11-02 | Paper |
| Finding vertex-surjective graph homomorphisms | 2012-10-15 | Paper |
| Computing vertex-surjective homomorphisms to partially reflexive trees | 2012-10-11 | Paper |
| Coloring Graphs Characterized by a Forbidden Subgraph | 2012-09-25 | Paper |
| Obtaining Planarity by Contracting Few Edges | 2012-09-25 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2012-09-25 | Paper |
| Computing role assignments of proper interval graphs in polynomial time | 2012-09-13 | Paper |
| On the parameterized complexity of coloring graphs in the absence of a linear forest | 2012-09-13 | Paper |
| Finding Vertex-Surjective Graph Homomorphisms | 2012-09-10 | Paper |
| Satisfiability of Acyclic and Almost Acyclic CNF Formulas. | 2012-08-29 | Paper |
| Induced disjoint paths in AT-free graphs | 2012-08-14 | Paper |
| Increasing the Minimum Degree of a Graph by Contractions | 2012-06-15 | Paper |
| 4-Coloring H-Free Graphs When H Is Small | 2012-06-15 | Paper |
| Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time | 2012-05-14 | Paper |
| Distance three labelings of trees | 2012-05-11 | Paper |
| On graph contractions and induced minors | 2012-05-11 | Paper |
| Finding induced paths of given parity in claw-free graphs | 2012-04-26 | Paper |
| The \(k\)-in-a-path problem for claw-free graphs | 2012-04-26 | Paper |
| Containment relations in split graphs | 2012-03-19 | Paper |
| Updating the complexity status of coloring graphs without a fixed induced linear forest | 2012-03-13 | Paper |
| Induced packing of odd cycles in planar graphs | 2012-03-13 | Paper |
| Computing solutions for matching games | 2012-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113764 | 2012-01-23 | Paper |
| Parameterizing cut sets in a graph by the number of their components | 2012-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104255 | 2011-12-19 | Paper |
| Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths | 2011-12-16 | Paper |
| List Coloring in the Absence of a Linear Forest | 2011-12-16 | Paper |
| On partitioning a graph into two connected subgraphs | 2011-12-07 | Paper |
| Graph labelings derived from models in distributed computing: A complete complexity classification | 2011-11-21 | Paper |
| Contracting planar graphs to contractions of triangulations | 2011-08-23 | Paper |
| Coloring Graphs without Short Cycles and Long Induced Paths | 2011-08-19 | Paper |
| Contracting a Chordal Graph to a Split Graph or a Tree | 2011-08-17 | Paper |
| On disconnected cuts and separators | 2011-08-10 | Paper |
| Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees | 2011-06-17 | Paper |
| Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) | 2011-06-17 | Paper |
| Computing Role Assignments of Proper Interval Graphs in Polynomial Time | 2011-05-19 | Paper |
| On the Core and f-Nucleolus of Flow Games | 2011-04-27 | Paper |
| On Coloring Graphs without Induced Forests | 2010-12-09 | Paper |
| Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs | 2010-11-16 | Paper |
| Computing role assignments of chordal graphs | 2010-10-11 | Paper |
| Contractions of Planar Graphs in Polynomial Time | 2010-09-06 | Paper |
| Computing sharp 2-factors in claw-free graphs | 2010-08-18 | Paper |
| Comparing universal covers in polynomial time | 2010-08-13 | Paper |
| Obtaining Online Ecological Colourings by Generalizing First-Fit | 2010-06-22 | Paper |
| On Solution Concepts for Matching Games | 2010-06-17 | Paper |
| L(2,1,1)-Labeling Is NP-Complete for Trees | 2010-06-17 | Paper |
| Packing Bipartite Graphs with Covers of Complete Bipartite Graphs | 2010-05-28 | Paper |
| A new characterization of \(P_{6}\)-free graphs | 2010-05-25 | Paper |
| Path factors and parallel knock-out schemes of almost claw-free graphs | 2010-05-05 | Paper |
| On Contracting Graphs to Fixed Pattern Graphs | 2010-01-28 | Paper |
| Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs | 2010-01-21 | Paper |
| Finding Induced Paths of Given Parity in Claw-Free Graphs | 2010-01-21 | Paper |
| Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs | 2010-01-18 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Induced Packing of Odd Cycles in a Planar Graph | 2009-12-17 | Paper |
| Parameterizing Cut Sets in a Graph by the Number of Their Components | 2009-12-17 | Paper |
| On Partitioning a Graph into Two Connected Subgraphs | 2009-12-17 | Paper |
| \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings | 2009-12-15 | Paper |
| Three Complexity Results on Coloring P k -Free Graphs | 2009-12-11 | Paper |
| Partitioning graphs into connected parts | 2009-11-06 | Paper |
| Computing Role Assignments of Chordal Graphs | 2009-10-20 | Paper |
| Partitioning Graphs into Connected Parts | 2009-08-18 | Paper |
| Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number | 2009-08-03 | Paper |
| The computational complexity of graph contractions II: Two tough polynomially solvable cases | 2009-06-16 | Paper |
| Covering graphs with few complete bipartite subgraphs | 2009-05-28 | Paper |
| Upper bounds and algorithms for parallel knock-out numbers | 2009-03-30 | Paper |
| A New Algorithm for On-line Coloring Bipartite Graphs | 2009-03-16 | Paper |
| Computing Sharp 2-Factors in Claw-Free Graphs | 2009-02-03 | Paper |
| The Computational Complexity of the Parallel Knock-Out Problem | 2008-09-18 | Paper |
| Graph Labelings Derived from Models in Distributed Computing | 2008-09-04 | Paper |
| A New Characterization of P 6-Free Graphs | 2008-07-10 | Paper |
| The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases | 2008-06-20 | Paper |
| On components of 2-factors in claw-free graphs | 2008-06-05 | Paper |
| Comparing Universal Covers in Polynomial Time | 2008-06-05 | Paper |
| Locally constrained graph homomorphisms and equitable partitions | 2008-05-13 | Paper |
| Covering Graphs with Few Complete Bipartite Subgraphs | 2008-04-24 | Paper |
| The computational complexity of the parallel knock-out problem | 2008-04-15 | Paper |
| Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars | 2008-03-07 | Paper |
| Cycles through specified vertices in triangle-free graphs | 2008-02-22 | Paper |
| Relative length of longest paths and longest cycles in triangle-free graphs | 2008-02-11 | Paper |
| Upper Bounds and Algorithms for Parallel Knock-Out Numbers | 2007-11-15 | Paper |
| On-Line Coloring of H-Free Bipartite Graphs | 2007-05-02 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| A complete complexity classification of the role assignment problem | 2006-03-20 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Matching Games: The Least Core and the Nucleolus | 2005-11-11 | Paper |
| The computational complexity of the elimination problem in generalized sports competitions | 2005-08-22 | Paper |
| The new FIFA rules are hard: Complexity aspects of sports competitions. | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449222 | 2004-02-08 | Paper |
| Two extensions of the shapley value for cooperative games | 2003-07-15 | Paper |
| Note on the computational complexity of least core concepts for min-cost spanning tree games. | 2000-01-01 | Paper |
