default search action
Kolja B. Knauer
Kolja Knauer
Person information
- affiliation: Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Carolina Benedetti-Velásquez, Kolja Knauer:
Lattice Path Matroids and Quotients. Comb. 44(3): 621-650 (2024) - [j47]Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano
:
On k-neighborly reorientations of oriented matroids. Eur. J. Comb. 118: 103938 (2024) - [j46]Victor Chepoi
Labeled sample compression schemes for complexes of oriented matroids. J. Comput. Syst. Sci. 144: 103543 (2024) - [j45]Kolja Knauer, William T. Trotter:
Concepts of Dimension for Convex Geometries. SIAM J. Discret. Math. 38(2): 1566-1585 (2024) - [i43]Kolja Knauer, Torsten Ueckerdt:
Partitioning a Planar Graph into two Triangle-Forests. CoRR abs/2401.15394 (2024) - [i42]Sara Asensio, Ignacio García-Marco, Kolja Knauer:
Sensitivity of m-ary functions and low degree partitions of Hamming graphs. CoRR abs/2409.16141 (2024) - 2023
- [j44]Jean Cardinal, Kolja Knauer
Colouring bottomless rectangles and arborescences. Comput. Geom. 115: 102020 (2023) - [j43]Kolja Knauer, Tilen Marc:
Corners and simpliciality in oriented matroids and partial cubes. Eur. J. Comb. 112: 103714 (2023) - [c13]Kolja Knauer:
Some Problems in Cayley Graphs and Computational Approaches (invited paper). ITAT 2023: 6 - [i41]Kolja Knauer, William T. Trotter:
Concepts of Dimension for Convex Geometries. CoRR abs/2303.08945 (2023) - [i40]Kolja Knauer, Torsten Ueckerdt:
Clustered independence and bounded treewidth. CoRR abs/2303.13655 (2023) - [i39]Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher:
Roudneff's Conjecture in Dimension 4. CoRR abs/2303.14212 (2023) - [i38]Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer
Boundedness for proper conflict-free and odd colorings. CoRR abs/2308.00170 (2023) - 2022
- [j42]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29(1) (2022) - [j41]Kolja Knauer, Hoang La, Petru Valicov:
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. Electron. J. Comb. 29(4) (2022) - [j40]Ignacio García-Marco
On sensitivity in bipartite Cayley graphs. J. Comb. Theory B 154: 211-238 (2022) - [j39]Victor Chepoi, Kolja Knauer, Manon Philibert:
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. SIAM J. Discret. Math. 36(1): 509-535 (2022) - [i37]Ignacio García-Marco, Kolja Knauer:
Beyond symmetry in generalized Petersen graphs. CoRR abs/2202.06785 (2022) - [i36]Carolina Benedetti, Kolja Knauer:
Lattice path matroids and quotients. CoRR abs/2202.11634 (2022) - 2021
- [j38]Oswin Aichholzer
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (2021) - [j37]Ignacio García-Marco
Chomp on generalized Kneser graphs and others. Int. J. Game Theory 50(3): 603-621 (2021) - [j36]Guillaume Guégan
The interval number of a planar graph is at most three. J. Comb. Theory B 146: 61-67 (2021) - [i35]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the dichromatic number of surfaces. CoRR abs/2102.01034 (2021) - [i34]Kolja Knauer, Gil Puig i Surroca:
On monoid graphs. CoRR abs/2110.00993 (2021) - [i33]Victor Chepoi, Kolja Knauer, Manon Philibert:
Labeled sample compression schemes for complexes of oriented matroids. CoRR abs/2110.15168 (2021) - [i32]Kolja Knauer, Hoang La, Petru Valicov:
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth. CoRR abs/2111.14986 (2021) - 2020
- [j35]Sarah Blind, Kolja Knauer, Petru Valicov:
Enumerating k-Arc-Connected Orientations. Algorithmica 82(12): 3588-3603 (2020) - [j34]Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner
Complete Acyclic Colorings. Electron. J. Comb. 27(2): 2 (2020) - [j33]Victor Chepoi, Kolja Knauer, Manon Philibert:
Two-Dimensional Partial Cubes. Electron. J. Comb. 27(3): 3 (2020) - [j32]Kolja Knauer
On Tope Graphs of Complexes of Oriented Matroids. Discret. Comput. Geom. 63(2): 377-417 (2020) - [j31]Victor Chepoi, Kolja Knauer, Tilen Marc
Hypercellular graphs: Partial cubes without Q3- as partial cube minor. Discret. Math. 343(4): 111678 (2020) - [c12]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. WG 2020: 161-173 - [i31]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. CoRR abs/2007.07806 (2020) - [i30]Victor Chepoi
Ample completions of OMs and CUOMs. CoRR abs/2007.12527 (2020) - [i29]Ignacio García-Marco, Kolja Knauer:
On sensitivity in bipartite Cayley graphs. CoRR abs/2009.00554 (2020)
2010 – 2019
- 2019
- [j30]Kolja Knauer, Nicolas Nisse:
Computing metric hulls in graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j29]Kolja Knauer
Cuts in matchings of 3-connected cubic graphs. Eur. J. Comb. 76: 27-36 (2019) - [j28]Kolja Knauer
Decomposing 4-connected planar triangulations into two trees and one path. J. Comb. Theory B 134: 88-109 (2019) - [j27]Kolja Knauer, Daniel Gonçalves
On the structure of Schnyder woods on orientable surfaces. J. Comput. Geom. 10(1): 127-163 (2019) - [c11]Oswin Aichholzer
Flip Distances Between Graph Orientations. WG 2019: 120-134 - [i28]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (2019) - [i27]Victor Chepoi
Two-dimensional partial cubes. CoRR abs/1906.04492 (2019) - [i26]Sandi Klavzar, Kolja Knauer, Tilen Marc:
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. CoRR abs/1906.06111 (2019) - [i25]Sarah Blind, Kolja Knauer, Petru Valicov:
Enumerating k-arc-connected orientations. CoRR abs/1908.02050 (2019) - 2018
- [j26]Kolja Knauer
A Tutte polynomial inequality for lattice path matroids. Adv. Appl. Math. 94: 23-38 (2018) - [j25]Kolja Knauer
How Many Circuits Determine an Oriented Matroid? Comb. 38(4): 861-885 (2018) - [j24]Kolja Knauer
On Lattice Path Matroid Polytopes: Integer Points and Ehrhart Polynomial. Discret. Comput. Geom. 60(3): 698-719 (2018) - [j23]Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer
COMs: Complexes of oriented matroids. J. Comb. Theory A 156: 195-237 (2018) - [c10]Kolja Knauer
The Queue-Number of Posets of Bounded Width or Height. GD 2018: 200-212 - [i24]Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt:
The interval number of a planar graph is at most three. CoRR abs/1805.02947 (2018) - [i23]Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The queue-number of planar posets. CoRR abs/1806.04489 (2018) - 2017
- [j22]Rémi Desgranges, Kolja Knauer
A correction of a characterization of planar partial cubes. Discret. Math. 340(6): 1151-1153 (2017) - [j21]Kolja Knauer
Planar Digraphs without Large Acyclic Sets. J. Graph Theory 85(1): 288-291 (2017) - [i22]Kolja Knauer, Tilen Marc:
On tope graphs of complexes of oriented matroids. CoRR abs/1701.05525 (2017) - [i21]Ignacio García-Marco, Kolja Knauer:
Chomp on numerical semigroups. CoRR abs/1705.11034 (2017) - [i20]Kolja Knauer, Torsten Ueckerdt:
Decomposing 4-connected planar triangulations into two trees and one path. CoRR abs/1710.02411 (2017) - [i19]Kolja Knauer, Nicolas Nisse:
Computing metric hulls in graphs. CoRR abs/1710.02958 (2017) - [i18]Kolja Knauer, Petru Valicov:
Cuts in matchings of 3-edge-connected cubic graphs. CoRR abs/1712.06143 (2017) - 2016
- [j20]Ignacio García-Marco
Drawing graphs with vertices and edges in convex position. Comput. Geom. 58: 25-33 (2016) - [j19]Stefan Felsner, Kolja B. Knauer
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206: 48-55 (2016) - [j18]Kolja B. Knauer
Three ways to cover a graph. Discret. Math. 339(2): 745-758 (2016) - [j17]Marie Albenque, Kolja Knauer
Convexity in partial cubes: The hull number. Discret. Math. 339(2): 866-876 (2016) - [j16]Boris Albar, Daniel Gonçalves
Orienting Triangulations. J. Graph Theory 83(4): 392-405 (2016) - [j15]Bartlomiej Bosek
On the Duality of Semiantichains and Unichain Coverings. Order 33(1): 29-38 (2016) - [c9]Kolja Knauer
Graph Drawings with One Bend and Few Slopes. LATIN 2016: 549-561 - [i17]Victor Chepoi
Partial cubes without $Q_3^-$ minors. CoRR abs/1606.02154 (2016) - [i16]Rémi Desgranges, Kolja Knauer:
A correction of a characterization of planar partial cubes. CoRR abs/1610.05466 (2016) - 2015
- [j14]Leonhard Lücken, Jan Philipp Pade, Kolja Knauer
Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of Delays. SIAM J. Appl. Dyn. Syst. 14(1): 286-304 (2015) - [c8]Ignacio García-Marco, Kolja Knauer
Drawing Graphs with Vertices and Edges in Convex Position. GD 2015: 348-359 - [i15]Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque:
Structure of Schnyder labelings on orientable surfaces. CoRR abs/1501.05475 (2015) - [i14]Kolja Knauer, Petru Valicov:
Planar digraphs without large acyclic sets. CoRR abs/1504.06726 (2015) - [i13]Kolja B. Knauer, Bartosz Walczak:
Graph drawings with one bend and few slopes. CoRR abs/1506.04423 (2015) - [i12]Hans-Jürgen Bandelt, Victor Chepoi
COMs: Complexes of Oriented Matroids. CoRR abs/1507.06111 (2015) - [i11]Ignacio García-Marco, Kolja Knauer:
Drawing graphs with vertices and edges in convex position. CoRR abs/1509.01981 (2015) - [i10]Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín:
A Tutte polynomial inequality for lattice path matroids. CoRR abs/1510.00600 (2015) - 2014
- [j13]Kolja B. Knauer
Outerplanar graph drawings with few slopes. Comput. Geom. 47(5): 614-624 (2014) - [j12]Daniel Heldt, Kolja B. Knauer
Edge-intersection graphs of grid paths: The bend-number. Discret. Appl. Math. 167: 144-162 (2014) - [j11]Daniel Heldt, Kolja B. Knauer
On the bend-number of planar and outerplanar graphs. Discret. Appl. Math. 179: 109-119 (2014) - [j10]Kolja B. Knauer
A graph-theoretical axiomatization of oriented matroids. Eur. J. Comb. 35: 388-391 (2014) - [j9]Jean Cardinal, Kolja B. Knauer
Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. 28(4): 1948-1959 (2014) - [c7]Marie Albenque, Kolja B. Knauer
Convexity in Partial Cubes: The Hull Number. LATIN 2014: 421-432 - [c6]Stefan Felsner, Kolja B. Knauer
Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) 2014: 299-310 - [c5]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SODA 2014: 1424-1432 - [i9]Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
On the Duality of Semiantichains and Unichain Coverings. CoRR abs/1401.1225 (2014) - 2013
- [j8]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. J. Comput. Geom. 4(1): 240-246 (2013) - [c4]Andrei Asinowski
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i8]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i7]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. CoRR abs/1307.2705 (2013) - [i6]Marie Albenque, Kolja B. Knauer:
Convexity in partial cubes: the hull number. CoRR abs/1309.5724 (2013) - 2012
- [c3]Kolja B. Knauer
Outerplanar Graph Drawings with Few Slopes. COCOON 2012: 323-334 - [c2]Bartlomiej Bosek
News about Semiantichains and Unichain Coverings. CSR 2012: 43-51 - [c1]Daniel Heldt, Kolja B. Knauer
On the Bend-Number of Planar and Outerplanar Graphs. LATIN 2012: 458-469 - [i5]Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar graph drawings with few slopes. CoRR abs/1205.2548 (2012) - [i4]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. CoRR abs/1212.2346 (2012) - 2011
- [j7]Kolja B. Knauer
How to eat 4/9 of a pizza. Discret. Math. 311(16): 1635-1645 (2011) - [j6]Stefan Felsner, Kolja B. Knauer
Distributive lattices, polyhedra, and generalized flows. Eur. J. Comb. 32(1): 45-59 (2011) - [j5]Stefan Felsner, Ricardo Gómez Aiza, Kolja B. Knauer
Cubic time recognition of cocircuit graphs of uniform oriented matroids. Eur. J. Comb. 32(1): 60-66 (2011) - [j4]Kolja B. Knauer
A graph-theoretical axiomatization of oriented matroids. Electron. Notes Discret. Math. 38: 523-528 (2011) - [i3]Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
On the bend-number of planar and outerplanar graphs. CoRR abs/1112.3353 (2011) - 2010
- [i2]Daniel Heldt, Kolja Knauer, Torsten Ueckerdt:
Edge-intersection graphs of grid paths: the bend-number. CoRR abs/1009.2861 (2010)
2000 – 2009
- 2009
- [j3]Stefan Felsner, Kolja B. Knauer
ULD-Lattices and Delta-Bonds. Comb. Probab. Comput. 18(5): 707-724 (2009) - [j2]Kolja B. Knauer
Chip-Firing, Antimatroids, and Polyhedra. Electron. Notes Discret. Math. 34: 9-13 (2009) - [j1]Ricardo Gómez Aiza, Juan José Montellano-Ballesteros
Polynomial Time Recognition of Uniform Cocircuit Graphs. Electron. Notes Discret. Math. 35: 29-34 (2009) - 2008
- [i1]Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
How to eat 4/9 of a pizza. CoRR abs/0812.2870 (2008)
Coauthor Index
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-10-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: