Kolja Knauer

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 64

Top Topics

Monadic Datalog

Computational Approaches

Top Venues

Electron. J. Comb.

Publications

Carolina Benedetti-Velásquez, Kolja Knauer
Lattice Path Matroids and Quotients. Comb. 44 (3) (2024)
Kolja Knauer, Torsten Ueckerdt
Partitioning a Planar Graph into two Triangle-Forests. CoRR (2024)
Kolja Knauer, William T. Trotter
Concepts of Dimension for Convex Geometries. SIAM J. Discret. Math. 38 (2) (2024)
Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano
On k-neighborly reorientations of oriented matroids. Eur. J. Comb. 118 (2024)
Victor Chepoi, Kolja Knauer, Manon Philibert
Labeled sample compression schemes for complexes of oriented matroids. J. Comput. Syst. Sci. 144 (2024)
Kolja Knauer
Some Problems in Cayley Graphs and Computational Approaches (invited paper). ITAT (2023)
Kolja Knauer, Torsten Ueckerdt
Clustered independence and bounded treewidth. CoRR (2023)
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora
Boundedness for proper conflict-free and odd colorings. CoRR (2023)
Kolja Knauer, Tilen Marc
Corners and simpliciality in oriented matroids and partial cubes. Eur. J. Comb. 112 (2023)
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences. Comput. Geom. 115 (2023)
Kolja Knauer, William T. Trotter
Concepts of Dimension for Convex Geometries. CoRR (2023)
Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher
Roudneff's Conjecture in Dimension 4. CoRR (2023)
Ignacio García-Marco, Kolja Knauer
On sensitivity in bipartite Cayley graphs. J. Comb. Theory, Ser. B 154 (2022)
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29 (1) (2022)
Victor Chepoi, Kolja Knauer, Manon Philibert
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. SIAM J. Discret. Math. 36 (1) (2022)
Ignacio García-Marco, Kolja Knauer
Beyond symmetry in generalized Petersen graphs. CoRR (2022)
Carolina Benedetti, Kolja Knauer
Lattice path matroids and quotients. CoRR (2022)
Kolja Knauer, Hoang La, Petru Valicov
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. Electron. J. Comb. 29 (4) (2022)
Kolja Knauer, Gil Puig i Surroca
On monoid graphs. CoRR (2021)
Victor Chepoi, Kolja Knauer, Manon Philibert
Labeled sample compression schemes for complexes of oriented matroids. CoRR (2021)
Kolja Knauer, Hoang La, Petru Valicov
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth. CoRR (2021)
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
On the dichromatic number of surfaces. CoRR (2021)
Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano
Chomp on generalized Kneser graphs and others. Int. J. Game Theory 50 (3) (2021)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2021)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. J. Comb. Theory, Ser. B 146 (2021)
Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner
Complete Acyclic Colorings. Electron. J. Comb. 27 (2) (2020)
Victor Chepoi, Kolja Knauer, Tilen Marc
Hypercellular graphs: Partial cubes without Q3- as partial cube minor. Discret. Math. 343 (4) (2020)
Victor Chepoi, Kolja Knauer, Manon Philibert
Ample completions of OMs and CUOMs. CoRR (2020)
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Plattenbauten: Touching Rectangles in Space. WG (2020)
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Plattenbauten: Touching Rectangles in Space. CoRR (2020)
Victor Chepoi, Kolja Knauer, Manon Philibert
Two-Dimensional Partial Cubes. Electron. J. Comb. 27 (3) (2020)
Sarah Blind, Kolja Knauer, Petru Valicov
Enumerating k-Arc-Connected Orientations. Algorithmica 82 (12) (2020)
Kolja Knauer, Tilen Marc
On Tope Graphs of Complexes of Oriented Matroids. Discret. Comput. Geom. 63 (2) (2020)
Ignacio García-Marco, Kolja Knauer
On sensitivity in bipartite Cayley graphs. CoRR (2020)
Sandi Klavzar, Kolja Knauer, Tilen Marc
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. CoRR (2019)
Kolja Knauer, Petru Valicov
Cuts in matchings of 3-connected cubic graphs. Eur. J. Comb. 76 (2019)
Kolja Knauer, Nicolas Nisse
Computing metric hulls in graphs. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip distances between graph orientations. CoRR (2019)
Kolja Knauer, Torsten Ueckerdt
Decomposing 4-connected planar triangulations into two trees and one path. J. Comb. Theory, Ser. B 134 (2019)
Kolja Knauer, Daniel Gonçalves, Benjamin Lévêque
On the structure of Schnyder woods on orientable surfaces. J. Comput. Geom. 10 (1) (2019)
Victor Chepoi, Kolja Knauer, Manon Philibert
Two-dimensional partial cubes. CoRR (2019)
Sarah Blind, Kolja Knauer, Petru Valicov
Enumerating k-arc-connected orientations. CoRR (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. WG (2019)
Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín
On Lattice Path Matroid Polytopes: Integer Points and Ehrhart Polynomial. Discret. Comput. Geom. 60 (3) (2018)
Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín
A Tutte polynomial inequality for lattice path matroids. Adv. Appl. Math. 94 (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The Queue-Number of Posets of Bounded Width or Height. Graph Drawing (2018)
Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer
COMs: Complexes of oriented matroids. J. Comb. Theory, Ser. A 156 (2018)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. CoRR (2018)
Kolja Knauer, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín
How Many Circuits Determine an Oriented Matroid? Comb. 38 (4) (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The queue-number of planar posets. CoRR (2018)
Kolja Knauer, Nicolas Nisse
Computing metric hulls in graphs. CoRR (2017)
Kolja Knauer, Tilen Marc
On tope graphs of complexes of oriented matroids. CoRR (2017)
Ignacio García-Marco, Kolja Knauer
Chomp on numerical semigroups. CoRR (2017)
Rémi Desgranges, Kolja Knauer
A correction of a characterization of planar partial cubes. Discret. Math. 340 (6) (2017)
Kolja Knauer, Torsten Ueckerdt
Decomposing 4-connected planar triangulations into two trees and one path. CoRR (2017)
Kolja Knauer, Petru Valicov, Paul S. Wenger
Planar Digraphs without Large Acyclic Sets. J. Graph Theory 85 (1) (2017)
Kolja Knauer, Petru Valicov
Cuts in matchings of 3-edge-connected cubic graphs. CoRR (2017)
Victor Chepoi, Kolja Knauer, Tilen Marc
Partial cubes without $Q_3^-$ minors. CoRR (2016)
Boris Albar, Daniel Gonçalves, Kolja Knauer
Orienting Triangulations. J. Graph Theory 83 (4) (2016)
Rémi Desgranges, Kolja Knauer
A correction of a characterization of planar partial cubes. CoRR (2016)
Marie Albenque, Kolja Knauer
Convexity in partial cubes: The hull number. Discret. Math. 339 (2) (2016)
Bartlomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki
On the Duality of Semiantichains and Unichain Coverings. Order 33 (1) (2016)
Ignacio García-Marco, Kolja Knauer
Drawing graphs with vertices and edges in convex position. Comput. Geom. 58 (2016)
Kolja Knauer, Bartosz Walczak
Graph Drawings with One Bend and Few Slopes. LATIN (2016)
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) (2015)
Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín
A Tutte polynomial inequality for lattice path matroids. CoRR (2015)
Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer
COMs: Complexes of Oriented Matroids. CoRR (2015)
Ignacio García-Marco, Kolja Knauer
Drawing graphs with vertices and edges in convex position. CoRR (2015)
Ignacio García-Marco, Kolja Knauer
Drawing Graphs with Vertices and Edges in Convex Position. Graph Drawing (2015)
Kolja Knauer, Petru Valicov
Planar digraphs without large acyclic sets. CoRR (2015)
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
Edge-intersection graphs of grid paths: the bend-number. CoRR (2010)