| Erdos-Posa Property For Labeled Minors: 2-Connected Minors | 0 | 0.34 | 2021 |
| How To Secure Matchings Against Edge Failures | 0 | 0.34 | 2021 |
| Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path | 0 | 0.34 | 2021 |
| On the Complexity of Stackelberg Matroid Pricing Problems. | 0 | 0.34 | 2020 |
| Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). | 0 | 0.34 | 2020 |
| Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable | 0 | 0.34 | 2019 |
| Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). | 0 | 0.34 | 2019 |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles: SCHAUDT and STEIN | 0 | 0.34 | 2019 |
| Stackelberg Packing Games. | 0 | 0.34 | 2019 |
| How to Secure Matchings Against Edge Failures. | 0 | 0.34 | 2019 |
| Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. | 1 | 0.37 | 2018 |
| Long cycles through prescribed vertices have the Erdős-Pósa property. | 0 | 0.34 | 2018 |
| The union-closed sets conjecture almost holds for almost all random bipartite graphs | 4 | 0.47 | 2017 |
| Revenue Maximization In Stackelberg Pricing Games: Beyond The Combinatorial Setting | 0 | 0.34 | 2017 |
| Fast Algorithms for Delta-Separated Sparsity Projection. | 1 | 0.41 | 2017 |
| Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. | 0 | 0.34 | 2017 |
| The Parameterized Complexity Of The Equidomination Problem | 0 | 0.34 | 2017 |
| OBSTRUCTIONS FOR THREE-COLORING AND LIST THREE-COLORING H-FREE GRAPHS | 1 | 0.36 | 2017 |
| On bounding the difference between the maximum degree and the chromatic number by a constant. | 0 | 0.34 | 2017 |
| Approximately coloring graphs without long induced paths. | 0 | 0.34 | 2017 |
| Exhaustive Generation of k-Critical ℋ-Free Graphs. | 0 | 0.34 | 2016 |
| Obstructions for three-coloring graphs with one forbidden induced subgraph. | 3 | 0.43 | 2016 |
| Minisum and Minimax Committee Election Rules for General Preference Types. | 3 | 0.37 | 2016 |
| A unified approach to recognize squares of split graphs. | 4 | 0.42 | 2016 |
| A New Characterization of $$P_k$$Pk-Free Graphs | 1 | 0.35 | 2016 |
| Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles | 0 | 0.34 | 2015 |
| The Journey of the Union-Closed Sets Conjecture. | 8 | 0.94 | 2015 |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. | 0 | 0.34 | 2015 |
| On Bounding the Difference of the Maximum Degree and the Clique Number. | 1 | 0.63 | 2015 |
| Exhaustive generation of $k$-critical $\mathcal H$-free graphs | 0 | 0.34 | 2015 |
| On bounding the difference between the maximum degree and the chromatic number by a constant | 0 | 0.34 | 2015 |
| A New Characterization of -Free Graphs | 0 | 0.34 | 2014 |
| Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. | 4 | 0.42 | 2014 |
| Claw-free t-perfect graphs can be recognised in polynomial time. | 1 | 0.36 | 2014 |
| Squares of $3$-sun-free split graphs. | 0 | 0.34 | 2014 |
| Structural Parameterizations for Boxicity. | 2 | 0.39 | 2014 |
| The Price of Connectivity for Vertex Cover | 9 | 0.67 | 2013 |
| A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles | 3 | 0.50 | 2013 |
| b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. | 0 | 0.34 | 2013 |
| Computing square roots of trivially perfect and threshold graphs | 14 | 0.70 | 2013 |
| On dominating sets whose induced subgraphs have a bounded diameter | 2 | 0.37 | 2013 |
| Connected dominating set in graphs without long paths and cycles. | 0 | 0.34 | 2013 |
| On the Separability of Graphs. | 0 | 0.34 | 2013 |
| The complexity of connected dominating sets and total dominating sets with specified induced subgraphs | 7 | 0.47 | 2012 |
| Paired- and induced paired-domination in (E, net)-free graphs. | 1 | 0.38 | 2012 |
| The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. | 1 | 0.39 | 2012 |
| On weighted efficient total domination | 3 | 0.42 | 2012 |
| Total domination versus paired domination. | 2 | 0.40 | 2012 |
| Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. | 0 | 0.34 | 2012 |
| Efficient total domination in digraphs | 2 | 0.38 | 2012 |
