Oliver Schaudt

97 papers A* 2A 2B 11C 7Journal 72Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Minimal obstructions to C5-coloring in hereditary graph classes. Inf. Comput. Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2025	J	`jnl`	Efficient Quantum Convolutional Neural Networks for Image Classification: Overcoming Hardware Constraints. CoRR Peter Röseler, Oliver Schaudt, Helmut Berg, Christian Bauckhage, Matthias Koch
2025	J	`jnl`	Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041). Dagstuhl Reports Akanksha Agrawal, Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt, Julien Codsi
2024	B	`conf`	Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2023	J	`jnl`	Stackelberg packing games. Theor. Comput. Sci. Toni Böhnlein, Oliver Schaudt, Joachim Schauer
2022	—	`conf`	Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2022	J	`jnl`	Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
2021	J	`jnl`	Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2021	J	`jnl`	Discrete optimization methods for group model selection in compressed sensing. Math. Program. Bubacarr Bah, Jannis Kurtz, Oliver Schaudt
2021	J	`jnl`	Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. Henning Bruhn, Felix Joos, Oliver Schaudt
2021	J	`jnl`	How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2021	J	`jnl`	Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program. Toni Böhnlein, Stefan Kratsch, Oliver Schaudt
2020	J	`jnl`	Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2020	J	`jnl`	Improved approximation algorithms for hitting 3-vertex paths. Math. Program. Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2020	J	`jnl`	Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020	J	`jnl`	Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020	C	`conf`	On the Complexity of Stackelberg Matroid Pricing Problems. IWOCA Toni Böhnlein, Oliver Schaudt
2020	J	`jnl`	Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
2019	J	`jnl`	Approximately Coloring Graphs Without Long Induced Paths. Algorithmica Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2019	J	`jnl`	Discrete Optimization Methods for Group Model Selection in Compressed Sensing. CoRR Bubacarr Bah, Jannis Kurtz, Oliver Schaudt
2019	J	`jnl`	Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt
2019	A	`conf`	How to Secure Matchings Against Edge Failures. STACS Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2019	J	`jnl`	Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory Oliver Schaudt, Maya Stein
2019	B	`conf`	Stackelberg Packing Games. WADS Toni Böhnlein, Oliver Schaudt, Joachim Schauer
2019	J	`jnl`	Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic
2018	J	`jnl`	Exhaustive generation of J. Graph Theory Jan Goedgebeur, Oliver Schaudt
2018	J	`jnl`	How to Secure Matchings Against Edge Failures. CoRR Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2018	J	`jnl`	Improved approximation algorithms for hitting 3-vertex paths. CoRR Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2018	J	`jnl`	Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory Henning Bruhn, Felix Joos, Oliver Schaudt
2018	J	`jnl`	Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2017	J	`jnl`	Almost Partitioning a 3-Edge-Colored K SIAM J. Discret. Math. Richard Lang, Oliver Schaudt, Maya Stein
2017	B	`conf`	Approximately Coloring Graphs Without Long Induced Paths. WG Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2017	J	`jnl`	Fast Algorithms for Delta-Separated Sparsity Projection. CoRR Henning Bruhn, Oliver Schaudt
2017	J	`jnl`	Obstructions for three-coloring and list three-coloring H-free graphs. CoRR Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2017	J	`jnl`	On bounding the difference between the maximum degree and the chromatic number by a constant. Discret. Appl. Math. Vera Weil, Oliver Schaudt
2017	A*	`conf`	Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. ICALP Toni Böhnlein, Stefan Kratsch, Oliver Schaudt
2017	B	`conf`	The Parameterized Complexity of the Equidomination Problem. WG Oliver Schaudt, Fabian Senger
2017	J	`jnl`	The Parameterized Complexity of the Equidomination Problem. CoRR Oliver Schaudt, Fabian Senger
2017	J	`jnl`	The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. Henning Bruhn, Oliver Schaudt
2016	J	`jnl`	A New Characterization of P Algorithmica Eglantine Camby, Oliver Schaudt
2016	J	`jnl`	A unified approach to recognize squares of split graphs. Theor. Comput. Sci. Van Bang Le, Andrea Oversberg, Oliver Schaudt
2016	J	`jnl`	Approximately coloring graphs without long induced paths. CoRR Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2016	J	`jnl`	Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. Henning Bruhn, Oliver Schaudt
2016	B	`conf`	Exhaustive Generation of k-Critical ℋ-Free Graphs. WG Jan Goedgebeur, Oliver Schaudt
2016	B	`conf`	Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2016	A	`conf`	Minisum and Minimax Committee Election Rules for General Preference Types. ECAI Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker
2016	A*	`conf`	Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2016	J	`jnl`	Structural Parameterizations for Boxicity. Algorithmica Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
2015	J	`jnl`	Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR Jan Goedgebeur, Oliver Schaudt
2015	J	`jnl`	Obstructions for three-coloring graphs without induced paths on six vertices. CoRR Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2015	J	`jnl`	On Bounding the Difference of the Maximum Degree and the Clique Number. Graphs Comb. Oliver Schaudt, Vera Weil
2015	J	`jnl`	On bounding the difference between the maximum degree and the chromatic number by a constant. CoRR Oliver Schaudt, Vera Weil
2015	J	`jnl`	On disjoint maximal independent sets in graphs. Inf. Process. Lett. Oliver Schaudt
2015	J	`jnl`	Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. Richard Lang, Oliver Schaudt, Maya Stein
2015	J	`jnl`	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. Oliver Schaudt, Maya Stein
2015	J	`jnl`	Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. Van Bang Le, Andrea Oversberg, Oliver Schaudt
2015	B	`conf`	Recognizing k-equistable Graphs in FPT Time. WG Eun Jung Kim, Martin Milanic, Oliver Schaudt
2015	J	`jnl`	Recognizing k-equistable graphs in FPT time. CoRR Eun Jung Kim, Martin Milanic, Oliver Schaudt
2015	J	`jnl`	The Journey of the Union-Closed Sets Conjecture. Graphs Comb. Henning Bruhn, Oliver Schaudt
2015	J	`jnl`	The graph formulation of the union-closed sets conjecture. Eur. J. Comb. Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
2015	J	`jnl`	b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2014	J	`jnl`	3-Colouring graphs without triangles or induced paths on seven vertices. CoRR Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein
2014	B	`conf`	A New Characterization of P WG Eglantine Camby, Oliver Schaudt
2014	J	`jnl`	A characterization of line graphs that are squares of graphs. Discret. Appl. Math. Martin Milanic, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	A new characterization of $P_k$-free graphs. CoRR Eglantine Camby, Oliver Schaudt
2014	B	`conf`	Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO Henning Bruhn, Oliver Schaudt
2014	J	`jnl`	Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR Oliver Schaudt, Maya Stein
2014	B	`conf`	Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	Squares of $3$-sun-free split graphs. CoRR Van Bang Le, Andrea Oversberg, Oliver Schaudt
2014	B	`conf`	Structural Parameterizations for Boxicity. WG Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
2014	J	`jnl`	The Price of Connectivity for Vertex Cover. Discret. Math. Theor. Comput. Sci. Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2014	J	`jnl`	The price of connectivity for dominating set: Upper bounds and complexity. Discret. Appl. Math. Eglantine Camby, Oliver Schaudt
2014	C	`conf`	b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2013	J	`jnl`	A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles CoRR Eglantine Camby, Oliver Schaudt
2013	J	`jnl`	Claw-free t-perfect graphs can be recognised in polynomial time. CoRR Henning Bruhn, Oliver Schaudt
2013	J	`jnl`	Computing square roots of trivially perfect and threshold graphs. Discret. Appl. Math. Martin Milanic, Oliver Schaudt
2013	C	`conf`	Connected dominating set in graphs without long paths and cycles. CTW Eglantine Camby, Oliver Schaudt
2013	J	`jnl`	On dominating sets whose induced subgraphs have a bounded diameter. Discret. Appl. Math. Oliver Schaudt
2013	J	`jnl`	On the separability of graphs. Discret. Math. Oliver Schaudt, Rainer Schrader, Vera Weil
2013	J	`jnl`	The Price of Connectivity for Vertex Cover CoRR Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2013	J	`jnl`	The journey of the union-closed sets conjecture. CoRR Henning Bruhn, Oliver Schaudt
2013	J	`jnl`	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2012	J	`jnl`	A note on connected dominating sets of distance-hereditary graphs. Discret. Appl. Math. Oliver Schaudt
2012	J	`jnl`	Efficient total domination in digraphs. J. Discrete Algorithms Oliver Schaudt
2012	C	`conf`	Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. CTW Oliver Schaudt, Vera Weil
2012	J	`jnl`	On graphs for which the connected domination number is at most the total domination number. Discret. Appl. Math. Oliver Schaudt
2012	C	`conf`	On the Separability of Graphs. CTW Oliver Schaudt, Rainer Schrader, Vera Weil
2012	J	`jnl`	On weighted efficient total domination. J. Discrete Algorithms Oliver Schaudt
2012	J	`jnl`	Paired- and induced paired-domination in ( Discuss. Math. Graph Theory Oliver Schaudt
2012	C	`conf`	The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. CTW Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2012	J	`jnl`	The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. Oliver Schaudt, Rainer Schrader
2012	J	`jnl`	Total domination versus paired domination. Discuss. Math. Graph Theory Oliver Schaudt
2011	—	`ch.`	Die Struktur dominierender Mengen in Graphen. Ausgezeichnete Informatikdissertationen Oliver Schaudt
2011	J	`jnl`	On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discret. Math. Oliver Schaudt
2011	—	`—`	The Structure of Dominating Subgraphs. Oliver Schaudt
2010	C	`conf`	Efficient Total Domination. CTW Oliver Schaudt