Oliver Schaudt

Joachim Schauer

Theor. Comput. Sci., 2023

2022

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).

[BibT_eX]

[DOI]

Dagstuhl Reports, November, 2022

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Theor. Comput. Sci., 2021

How to Secure Matchings against Edge Failures.

[BibT_eX]

[DOI]

Felix Hommelsheim

Moritz Mühlenthaler

SIAM J. Discret. Math., 2021

Erdös-Pósa Property for Labeled Minors: 2-Connected Minors.

[BibT_eX]

[DOI]

Felix Joos

SIAM J. Discret. Math., 2021

Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting.

[BibT_eX]

[DOI]

Toni Böhnlein

Stefan Kratsch

Math. Program., 2021

Discrete optimization methods for group model selection in compressed sensing.

[BibT_eX]

[DOI]

Bubacarr Bah

Jannis Kurtz

Math. Program., 2021

2020

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Improved approximation algorithms for hitting 3-vertex paths.

[BibT_eX]

[DOI]

Samuel Fiorini

Gwenaël Joret

Math. Program., 2020

Obstructions for three-coloring graphs without induced paths on six vertices.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.

[BibT_eX]

[DOI]

CoRR, 2020

On the Complexity of Stackelberg Matroid Pricing Problems.

[BibT_eX]

[DOI]

Toni Böhnlein

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271).

[BibT_eX]

[DOI]

Maria Chudnovsky

Daniël Paulusma

Dagstuhl Reports, 2019

Approximately Coloring Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Exhaustive generation of k-critical H-free graphs.

[BibT_eX]

[DOI]

Jan Goedgebeur

J. Graph Theory, 2018

Long cycles through prescribed vertices have the Erdős-Pósa property.

[BibT_eX]

[DOI]

Felix Joos

J. Graph Theory, 2018

How to Secure Matchings Against Edge Failures.

[BibT_eX]

[DOI]

CoRR, 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.

[BibT_eX]

[DOI]

Comb., 2018

2017

Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles.

[BibT_eX]

[DOI]

Richard Lang

SIAM J. Discret. Math., 2017

The union-closed sets conjecture almost holds for almost all random bipartite graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

On bounding the difference between the maximum degree and the chromatic number by a constant.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Fast Algorithms for Delta-Separated Sparsity Projection.

[BibT_eX]

[DOI]

CoRR, 2017

The Parameterized Complexity of the Equidomination Problem.

[BibT_eX]

[DOI]

Fabian Senger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

A unified approach to recognize squares of split graphs.

[BibT_eX]

[DOI]

Van Bang Le

Theor. Comput. Sci., 2016

Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

A New Characterization of Pk-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Structural Parameterizations for Boxicity.

[BibT_eX]

[DOI]

Algorithmica, 2016

Exhaustive Generation of k-Critical ℋ-Free Graphs.

[BibT_eX]

[DOI]

Jan Goedgebeur

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Obstructions for three-coloring graphs with one forbidden induced subgraph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minisum and Minimax Committee Election Rules for General Preference Types.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs.

[BibT_eX]

[DOI]

Van Bang Le

Theor. Comput. Sci., 2015

On disjoint maximal independent sets in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

On Bounding the Difference of the Maximum Degree and the Clique Number.

[BibT_eX]

[DOI]

Graphs Comb., 2015

The Journey of the Union-Closed Sets Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles.

[BibT_eX]

[DOI]

Richard Lang

Electron. Notes Discret. Math., 2015

The graph formulation of the union-closed sets conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Exhaustive generation of $k$-critical $\mathcal H$-free graphs.

[BibT_eX]

[DOI]

Jan Goedgebeur

CoRR, 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

[BibT_eX]

[DOI]

Algorithmica, 2015

Recognizing k-equistable Graphs in FPT Time.

[BibT_eX]

[DOI]

Eun Jung Kim

Martin Milanic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

The Price of Connectivity for Vertex Cover.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

A characterization of line graphs that are squares of graphs.

[BibT_eX]

[DOI]

Martin Milanic

Discret. Appl. Math., 2014

The price of connectivity for dominating set: Upper bounds and complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Partitioning two-coloured complete multipartite graphs into monochromatic paths.

[BibT_eX]

[DOI]

CoRR, 2014

Squares of $3$-sun-free split graphs.

[BibT_eX]

[DOI]

Van Bang Le

CoRR, 2014

A new characterization of $P_k$-free graphs.

[BibT_eX]

[DOI]

CoRR, 2014

3-Colouring graphs without triangles or induced paths on seven vertices.

[BibT_eX]

[DOI]

Flavia Bonomo

Maya Jakobine Stein

CoRR, 2014

Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

On the separability of graphs.

[BibT_eX]

[DOI]

Rainer Schrader

Discret. Math., 2013

On dominating sets whose induced subgraphs have a bounded diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Computing square roots of trivially perfect and threshold graphs.

[BibT_eX]

[DOI]

Martin Milanic

Discret. Appl. Math., 2013

A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles

[BibT_eX]

[DOI]

CoRR, 2013

Connected dominating set in graphs without long paths and cycles.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Efficient total domination in digraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On weighted efficient total domination.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs.

[BibT_eX]

[DOI]

Rainer Schrader

Inf. Process. Lett., 2012

Paired- and induced paired-domination in (E, net)-free graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

Total domination versus paired domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

A note on connected dominating sets of distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On graphs for which the connected domination number is at most the total domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

The Structure of Dominating Subgraphs.

[BibT_eX]

[DOI]

PhD thesis, 2011

On the existence of total dominating subgraphs with a prescribed additive hereditary property.

[BibT_eX]

[DOI]

Discret. Math., 2011

Die Struktur dominierender Mengen in Graphen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010

Efficient Total Domination.

[BibT_eX]