![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Oliver Schaudt
Person information
- affiliation: University of Cologne, Germany
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j45]Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg packing games. Theor. Comput. Sci. 943: 16-35 (2023) - 2022
- [c21]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT 2022: 5:1-5:19 - [i25]Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma
, Oliver Schaudt, Akanksha Agrawal:
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12(11): 109-123 (2022) - 2021
- [j44]Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program. 187(1): 653-695 (2021) - [j43]Bubacarr Bah
, Jannis Kurtz
, Oliver Schaudt:
Discrete optimization methods for group model selection in compressed sensing. Math. Program. 190(1): 171-220 (2021) - [j42]Henning Bruhn, Felix Joos
, Oliver Schaudt:
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. 35(2): 893-914 (2021) - [j41]Felix Hommelsheim
, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35(3): 2265-2292 (2021) - [j40]Flavia Bonomo-Braberman, Maria Chudnovsky
, Jan Goedgebeur
, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850: 98-115 (2021) - 2020
- [j39]Britta Peis, Oliver Schaudt, Heiko Röglin
, Bert Randerath, Rainer Schrader, Frank Vallentin:
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272: 1 (2020) - [j38]Maria Chudnovsky
, Jan Goedgebeur
, Oliver Schaudt, Mingxian Zhong
:
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140: 45-83 (2020) - [j37]Samuel Fiorini, Gwenaël Joret
, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1): 355-367 (2020) - [j36]Maria Chudnovsky
, Jan Goedgebeur
, Oliver Schaudt, Mingxian Zhong
:
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34(1): 431-469 (2020) - [c20]Toni Böhnlein, Oliver Schaudt:
On the Complexity of Stackelberg Matroid Pricing Problems. IWOCA 2020: 83-96 - [i24]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR abs/2009.05382 (2020)
2010 – 2019
- 2019
- [j35]Maria Chudnovsky
, Oliver Schaudt, Sophie Spirkl
, Maya Stein
, Mingxian Zhong
:
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - [j34]Oliver Schaudt
, Maya Stein
:
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory 91(2): 122-147 (2019) - [j33]Maria Chudnovsky
, Chun-Hung Liu
, Oliver Schaudt, Sophie Spirkl
, Nicolas Trotignon
, Kristina Vuskovic
:
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92(2): 67-95 (2019) - [c19]Felix Hommelsheim
, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. STACS 2019: 38:1-38:16 - [c18]Toni Böhnlein, Oliver Schaudt, Joachim Schauer
:
Stackelberg Packing Games. WADS 2019: 239-253 - [i23]Bubacarr Bah, Jannis Kurtz, Oliver Schaudt:
Discrete Optimization Methods for Group Model Selection in Compressed Sensing. CoRR abs/1904.01542 (2019) - [i22]Maria Chudnovsky, Daniël Paulusma
, Oliver Schaudt:
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports 9(6): 125-142 (2019) - 2018
- [j32]Flavia Bonomo, Maria Chudnovsky
, Peter Maceli, Oliver Schaudt, Maya Stein
, Mingxian Zhong
:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38(4): 779-801 (2018) - [j31]Jan Goedgebeur
, Oliver Schaudt:
Exhaustive generation of k-critical H-free graphs. J. Graph Theory 87(2): 188-207 (2018) - [j30]Henning Bruhn, Felix Joos, Oliver Schaudt:
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87(3): 275-284 (2018) - [i21]Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. CoRR abs/1805.01299 (2018) - [i20]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. CoRR abs/1808.10370 (2018) - 2017
- [j29]Vera Weil, Oliver Schaudt:
On bounding the difference between the maximum degree and the chromatic number by a constant. Discret. Appl. Math. 231: 228-234 (2017) - [j28]Henning Bruhn, Oliver Schaudt:
The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. 59: 129-149 (2017) - [j27]Richard Lang
, Oliver Schaudt, Maya Stein
:
Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. SIAM J. Discret. Math. 31(2): 1374-1402 (2017) - [c17]Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. ICALP 2017: 46:1-46:13 - [c16]Maria Chudnovsky
, Oliver Schaudt, Sophie Spirkl
, Maya Stein
, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - [c15]Oliver Schaudt, Fabian Senger:
The Parameterized Complexity of the Equidomination Problem. WG 2017: 412-424 - [i19]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR abs/1703.05684 (2017) - [i18]Oliver Schaudt, Fabian Senger:
The Parameterized Complexity of the Equidomination Problem. CoRR abs/1705.05599 (2017) - [i17]Henning Bruhn, Oliver Schaudt:
Fast Algorithms for Delta-Separated Sparsity Projection. CoRR abs/1712.06706 (2017) - 2016
- [j26]Henning Bruhn, Morgan Chopin
, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. Algorithmica 74(4): 1453-1472 (2016) - [j25]Eglantine Camby, Oliver Schaudt:
A New Characterization of Pk-Free Graphs. Algorithmica 75(1): 205-217 (2016) - [j24]Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. 30(2): 832-855 (2016) - [j23]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
A unified approach to recognize squares of split graphs. Theor. Comput. Sci. 648: 26-33 (2016) - [c14]Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker:
Minisum and Minimax Committee Election Rules for General Preference Types. ECAI 2016: 1656-1657 - [c13]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO 2016: 238-249 - [c12]Maria Chudnovsky
, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783 - [c11]Jan Goedgebeur
, Oliver Schaudt:
Exhaustive Generation of k-Critical ℋ-Free Graphs. WG 2016: 109-120 - [i16]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- [j22]Flavia Bonomo, Oliver Schaudt, Maya Stein
, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015) - [j21]Henning Bruhn, Pierre Charbit
, Oliver Schaudt, Jan Arne Telle:
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43: 210-219 (2015) - [j20]Richard Lang
, Oliver Schaudt, Maya Stein
:
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. 49: 787-794 (2015) - [j19]Oliver Schaudt, Maya Stein
:
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. 50: 313-318 (2015) - [j18]Oliver Schaudt, Vera Weil:
On Bounding the Difference of the Maximum Degree and the Clique Number. Graphs Comb. 31(5): 1689-1702 (2015) - [j17]Henning Bruhn, Oliver Schaudt:
The Journey of the Union-Closed Sets Conjecture. Graphs Comb. 31(6): 2043-2074 (2015) - [j16]Oliver Schaudt:
On disjoint maximal independent sets in graphs. Inf. Process. Lett. 115(1): 23-27 (2015) - [j15]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. 602: 39-49 (2015) - [c10]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable Graphs in FPT Time. WG 2015: 487-498 - [i15]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable graphs in FPT time. CoRR abs/1503.01098 (2015) - [i14]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015) - [i13]Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR abs/1506.03647 (2015) - [i12]Oliver Schaudt, Vera Weil:
On bounding the difference between the maximum degree and the chromatic number by a constant. CoRR abs/1511.08403 (2015) - 2014
- [j14]Martin Milanic
, Andrea Oversberg, Oliver Schaudt:
A characterization of line graphs that are squares of graphs. Discret. Appl. Math. 173: 83-91 (2014) - [j13]Eglantine Camby
, Oliver Schaudt:
The price of connectivity for dominating set: Upper bounds and complexity. Discret. Appl. Math. 177: 53-59 (2014) - [j12]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. Discret. Math. Theor. Comput. Sci. 16(1): 207-224 (2014) - [c9]Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO 2014: 404-415 - [c8]Flavia Bonomo, Oliver Schaudt, Maya Stein
, Mario Valencia-Pabon:
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO 2014: 100-111 - [c7]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. WG 2014: 117-128 - [c6]Eglantine Camby, Oliver Schaudt:
A New Characterization of Pk-free Graphs. WG 2014: 129-138 - [c5]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG 2014: 360-371 - [i11]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR abs/1402.0024 (2014) - [i10]Eglantine Camby, Oliver Schaudt:
A new characterization of $P_k$-free graphs. CoRR abs/1402.7213 (2014) - [i9]Oliver Schaudt, Maya Stein:
Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR abs/1407.5083 (2014) - [i8]Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein:
3-Colouring graphs without triangles or induced paths on seven vertices. CoRR abs/1410.0040 (2014) - [i7]Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Squares of $3$-sun-free split graphs. CoRR abs/1410.2075 (2014) - 2013
- [j11]Martin Milanic
, Oliver Schaudt:
Computing square roots of trivially perfect and threshold graphs. Discret. Appl. Math. 161(10-11): 1538-1545 (2013) - [j10]Oliver Schaudt:
On dominating sets whose induced subgraphs have a bounded diameter. Discret. Appl. Math. 161(16-17): 2647-2652 (2013) - [j9]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the separability of graphs. Discret. Math. 313(6): 809-820 (2013) - [i6]Eglantine Camby, Oliver Schaudt:
Connected dominating set in graphs without long paths and cycles. CTW 2013: 39-42 - [i5]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. CoRR abs/1303.2478 (2013) - [i4]Eglantine Camby, Oliver Schaudt:
A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles. CoRR abs/1303.2868 (2013) - [i3]Henning Bruhn, Oliver Schaudt:
The journey of the union-closed sets conjecture. CoRR abs/1309.3297 (2013) - [i2]Henning Bruhn, Oliver Schaudt:
Claw-free t-perfect graphs can be recognised in polynomial time. CoRR abs/1310.8186 (2013) - [i1]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR abs/1310.8313 (2013) - 2012
- [j8]Oliver Schaudt:
On graphs for which the connected domination number is at most the total domination number. Discret. Appl. Math. 160(7-8): 1281-1284 (2012) - [j7]Oliver Schaudt:
A note on connected dominating sets of distance-hereditary graphs. Discret. Appl. Math. 160(9): 1394-1398 (2012) - [j6]Oliver Schaudt:
Total domination versus paired domination. Discuss. Math. Graph Theory 32(3): 435-447 (2012) - [j5]Oliver Schaudt:
Paired- and induced paired-domination in (E, net)-free graphs. Discuss. Math. Graph Theory 32(3): 473-485 (2012) - [j4]Oliver Schaudt, Rainer Schrader:
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. 112(24): 953-957 (2012) - [j3]Oliver Schaudt:
On weighted efficient total domination. J. Discrete Algorithms 10: 61-69 (2012) - [j2]Oliver Schaudt:
Efficient total domination in digraphs. J. Discrete Algorithms 15: 32-42 (2012) - [c4]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. CTW 2012: 56-59 - [c3]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the Separability of Graphs. CTW 2012: 232-236 - [c2]Oliver Schaudt, Vera Weil:
Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. CTW 2012: 237-239 - 2011
- [b1]Oliver Schaudt:
The Structure of Dominating Subgraphs. University of Cologne, 2011, ISBN 978-3-8439-0196-3, pp. 1-157 - [j1]Oliver Schaudt:
On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discret. Math. 311(18-19): 2095-2101 (2011) - [p1]Oliver Schaudt:
Die Struktur dominierender Mengen in Graphen. Ausgezeichnete Informatikdissertationen 2011: 171-180 - 2010
- [c1]Oliver Schaudt:
Efficient Total Domination. CTW 2010: 149-152
Coauthor Index
aka: Maya Stein
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint