ULD-Lattices and Delta-Bonds. - Stefan Felsner; Kolja B. Knauer (Comb. Probab. Comput., 2009)

Polynomial Time Recognition of Uniform Cocircuit Graphs. - Ricardo Gómez Aiza; Juan José Montellano-Ballesteros; Ricardo Strausz; Kolja B. Knauer (Electron. Notes Discret. Math., 2009)

Chip-Firing, Antimatroids, and Polyhedra. - Kolja B. Knauer (Electron. Notes Discret. Math., 2009)

How to eat 4/9 of a pizza. - Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (Discret. Math., 2011)

Cubic time recognition of cocircuit graphs of uniform oriented matroids. - Stefan Felsner; Ricardo Gómez Aiza; Kolja B. Knauer; Juan José Montellano-Ballesteros; Ricardo Strausz (Eur. J. Comb., 2011)

Distributive lattices, polyhedra, and generalized flows. - Stefan Felsner; Kolja B. Knauer (Eur. J. Comb., 2011)

A graph-theoretical axiomatization of oriented matroids. - Kolja B. Knauer; Juan José Montellano-Ballesteros; Ricardo Strausz (Electron. Notes Discret. Math., 2011)

News about Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja B. Knauer; Grzegorz Matecki (CSR, 2012)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Making Triangles Colorful. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (J. Comput. Geom., 2013)

Outerplanar graph drawings with few slopes. - Kolja B. Knauer; Piotr Micek; Bartosz Walczak (Comput. Geom., 2014)

Edge-intersection graphs of grid paths: The bend-number. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

On the bend-number of planar and outerplanar graphs. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

Making Octants Colorful and Related Covering Decomposition Problems. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (SIAM J. Discret. Math., 2014)

Structure of Schnyder labelings on orientable surfaces. - Daniel Gonçalves 001; Kolja B. Knauer; Benjamin Lévêque (CoRR, 2015)

Planar digraphs without large acyclic sets. - Kolja Knauer; Petru Valicov (CoRR, 2015)

Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of Delays. - Leonhard Lücken; Jan Philipp Pade; Kolja Knauer (SIAM J. Appl. Dyn. Syst., 2015)

Graph Drawings with One Bend and Few Slopes. - Kolja Knauer; Bartosz Walczak (LATIN, 2016)

Drawing graphs with vertices and edges in convex position. - Ignacio García-Marco; Kolja Knauer (Comput. Geom., 2016)

Partial cubes without $Q_3^-$ minors. - Victor Chepoi; Kolja Knauer; Tilen Marc (CoRR, 2016)

Intersection graphs of L-shapes and segments in the plane. - Stefan Felsner; Kolja B. Knauer; George B. Mertzios; Torsten Ueckerdt (Discret. Appl. Math., 2016)

Convexity in partial cubes: The hull number. - Marie Albenque; Kolja Knauer (Discret. Math., 2016)

Three ways to cover a graph. - Kolja B. Knauer; Torsten Ueckerdt (Discret. Math., 2016)

Orienting Triangulations. - Boris Albar; Daniel Gonçalves 001; Kolja Knauer (J. Graph Theory, 2016)

On the Duality of Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja Knauer; Grzegorz Matecki (Order, 2016)

Chomp on numerical semigroups. - Ignacio García-Marco; Kolja Knauer (CoRR, 2017)

Cuts in matchings of 3-edge-connected cubic graphs. - Kolja Knauer; Petru Valicov (CoRR, 2017)

A correction of a characterization of planar partial cubes. - Rémi Desgranges; Kolja Knauer (Discret. Math., 2017)

Planar Digraphs without Large Acyclic Sets. - Kolja Knauer; Petru Valicov; Paul S. Wenger (J. Graph Theory, 2017)

The Queue-Number of Posets of Bounded Width or Height. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (GD, 2018)

A Tutte polynomial inequality for lattice path matroids. - Kolja Knauer; Leonardo Martínez-Sandoval; Jorge Luis Ramírez Alfonsín (Adv. Appl. Math., 2018)

How Many Circuits Determine an Oriented Matroid? - Kolja Knauer; Luis Pedro Montejano 001; Jorge Luis Ramírez Alfonsín (Comb., 2018)

The queue-number of planar posets. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (CoRR, 2018)

On Lattice Path Matroid Polytopes: Integer Points and Ehrhart Polynomial. - Kolja Knauer; Leonardo Martínez-Sandoval; Jorge Luis Ramírez Alfonsín (Discret. Comput. Geom., 2018)

COMs: Complexes of oriented matroids. - Hans-Jürgen Bandelt; Victor Chepoi; Kolja Knauer (J. Comb. Theory A, 2018)

On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. - Sandi Klavzar; Kolja Knauer; Tilen Marc (CoRR, 2019)

Computing metric hulls in graphs. - Kolja Knauer; Nicolas Nisse (Discret. Math. Theor. Comput. Sci., 2019)

Cuts in matchings of 3-connected cubic graphs. - Kolja Knauer; Petru Valicov (Eur. J. Comb., 2019)

Decomposing 4-connected planar triangulations into two trees and one path. - Kolja Knauer; Torsten Ueckerdt (J. Comb. Theory B, 2019)

On the structure of Schnyder woods on orientable surfaces. - Kolja Knauer; Daniel Gonçalves 001; Benjamin Lévêque (J. Comput. Geom., 2019)

Enumerating k-Arc-Connected Orientations. - Sarah Blind; Kolja Knauer; Petru Valicov (Algorithmica, 2020)

Two-Dimensional Partial Cubes. - Victor Chepoi; Kolja Knauer; Manon Philibert (Electron. J. Comb., 2020)

Complete Acyclic Colorings. - Stefan Felsner; Winfried Hochstättler; Kolja Knauer; Raphael Steiner (Electron. J. Comb., 2020)

Ample completions of OMs and CUOMs. - Victor Chepoi; Kolja Knauer; Manon Philibert (CoRR, 2020)

On Tope Graphs of Complexes of Oriented Matroids. - Kolja Knauer; Tilen Marc (Discret. Comput. Geom., 2020)

Hypercellular graphs: Partial cubes without Q3- as partial cube minor. - Victor Chepoi; Kolja Knauer; Tilen Marc (Discret. Math., 2020)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

On monoid graphs. - Kolja Knauer; Gil Puig i Surroca (CoRR, 2021)

Chomp on generalized Kneser graphs and others. - Ignacio García-Marco; Kolja Knauer; Luis Pedro Montejano 001 (Int. J. Game Theory, 2021)

The interval number of a planar graph is at most three. - Guillaume Guégan; Kolja Knauer; Jonathan Rollin; Torsten Ueckerdt (J. Comb. Theory B, 2021)

On the Dichromatic Number of Surfaces. - Pierre Aboulker; Frédéric Havet; Kolja Knauer; Clément Rambaud (Electron. J. Comb., 2022)

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. - Kolja Knauer; Hoang La; Petru Valicov (Electron. J. Comb., 2022)

Beyond symmetry in generalized Petersen graphs. - Ignacio García-Marco; Kolja Knauer (CoRR, 2022)

On sensitivity in bipartite Cayley graphs. - Ignacio García-Marco; Kolja Knauer (J. Comb. Theory B, 2022)

Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. - Victor Chepoi; Kolja Knauer; Manon Philibert (SIAM J. Discret. Math., 2022)

Some Problems in Cayley Graphs and Computational Approaches (invited paper). - Kolja Knauer (ITAT, 2023)

Clustered independence and bounded treewidth. - Kolja Knauer; Torsten Ueckerdt (CoRR, 2023)

Boundedness for proper conflict-free and odd colorings. - 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 (CoRR, 2023)

Corners and simpliciality in oriented matroids and partial cubes. - Kolja Knauer; Tilen Marc (Eur. J. Comb., 2023)

Colouring bottomless rectangles and arborescences. - Jean Cardinal; Kolja Knauer; Piotr Micek; Dömötör Pálvölgyi; Torsten Ueckerdt; Narmada Varadarajan (Comput. Geom., 2023)

Partitioning a Planar Graph into two Triangle-Forests. - Kolja Knauer; Torsten Ueckerdt (CoRR, 2024)

Sensitivity of m-ary functions and low degree partitions of Hamming graphs. - Sara Asensio; Ignacio García-Marco; Kolja Knauer (CoRR, 2024)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set. - Stijn Cambie; François Dross; Kolja Knauer; Hoang La; Petru Valicov (CoRR, 2024)

On k-neighborly reorientations of oriented matroids. - Rangel Hernández-Ortiz; Kolja Knauer; Luis Pedro Montejano 001 (Eur. J. Comb., 2024)

Labeled sample compression schemes for complexes of oriented matroids. - Victor Chepoi; Kolja Knauer; Manon Philibert (J. Comput. Syst. Sci., 2024)

Concepts of Dimension for Convex Geometries. - Kolja Knauer; William T. Trotter (SIAM J. Discret. Math., 2024)

Lattice Path Matroids and Quotients. - Carolina Benedetti-Velásquez; Kolja Knauer (Comb., 2024)

Coloring minimal Cayley graphs. - Ignacio García-Marco; Kolja Knauer (Eur. J. Comb., 2025)

Plattenbauten: Touching Rectangles in Space. - Stefan Felsner; Kolja Knauer; Torsten Ueckerdt (SIAM J. Discret. Math., 2025)

Finitary Affine Oriented Matroids. - Emanuele Delucchi; Kolja Knauer (Discret. Comput. Geom., 2025)

Roudneff's Conjecture in Dimension 4. - Rangel Hernández-Ortiz; Kolja Knauer; Luis Pedro Montejano 001; Manfred Scheucher (Exp. Math., 2025)

On rigid regular graphs and a problem of Babai and Pultr. - Kolja Knauer; Gil Puig i Surroca (CoRR, 2025)

The Signed Varchenko Determinant for Complexes of Oriented Matroids. - Winfried Hochstättler; Sophia Keip; Kolja Knauer (Comb., 2025)

Sensitivity and Hamming graphs. - Sara Asensio; Yuval Filmus; Ignacio García-Marco; Kolja Knauer (CoRR, 2025)

Odd coloring graphs with linear neighborhood complexity. - James Davies; Meike Hatzel; Kolja Knauer; Rose McCarty; Torsten Ueckerdt (CoRR, 2025)

What is and is not inside a Cayley graph? - Kolja Knauer; Alvaro Soto Gomez (CoRR, 2025)

Hamiltonian connectivity of some base-cobase graphs. - Leonardo Martínez-Sandoval; Kolja Knauer (CoRR, 2025)