Kolja B. Knauer

Discret. Comput. Geom., January, 2025

Coloring minimal Cayley graphs.

[BibT_eX]

[DOI]

Carolina Benedetti-Velásquez

Eur. J. Comb., 2025

2024

Lattice Path Matroids and Quotients.

[BibT_eX]

[DOI]

Comb., June, 2024

Concepts of Dimension for Convex Geometries.

[BibT_eX]

[DOI]

William T. Trotter

SIAM J. Discret. Math., 2024

Labeled sample compression schemes for complexes of oriented matroids.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2024

On k-neighborly reorientations of oriented matroids.

[BibT_eX]

[DOI]

Rangel Hernández-Ortiz

Eur. J. Comb., 2024

Partitions of planar (oriented) graphs into a connected acyclic and an independent set.

[BibT_eX]

[DOI]

CoRR, 2024

Sensitivity of <i>m</i>-ary functions and low degree partitions of Hamming graphs.

[BibT_eX]

[DOI]

Sara Asensio

CoRR, 2024

Partitioning a Planar Graph into two Triangle-Forests.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Colouring bottomless rectangles and arborescences.

[BibT_eX]

[DOI]

Comput. Geom., December, 2023

Corners and simpliciality in oriented matroids and partial cubes.

[BibT_eX]

[DOI]

Eur. J. Comb., August, 2023

Boundedness for proper conflict-free and odd colorings.

[BibT_eX]

[DOI]

Andrea Jiménez

Carla Negri Lintzmayer

CoRR, 2023

Roudneff's Conjecture in Dimension 4.

[BibT_eX]

[DOI]

Rangel Hernández-Ortiz

Manfred Scheucher

CoRR, 2023

Clustered independence and bounded treewidth.

[BibT_eX]

[DOI]

CoRR, 2023

Some Problems in Cayley Graphs and Computational Approaches (invited paper).

[BibT_eX]

[DOI]

Proceedings of the 23rd Conference Information Technologies, 2023

2022

Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

On sensitivity in bipartite Cayley graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Beyond symmetry in generalized Petersen graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.

[BibT_eX]

[DOI]

Hoang La

Electron. J. Comb., 2022

On the Dichromatic Number of Surfaces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

The interval number of a planar graph is at most three.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Chomp on generalized Kneser graphs and others.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2021

On monoid graphs.

[BibT_eX]

[DOI]

Gil Puig i Surroca

CoRR, 2021

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Hypercellular graphs: Partial cubes without Q3- as partial cube minor.

[BibT_eX]

[DOI]

Discret. Math., 2020

On Tope Graphs of Complexes of Oriented Matroids.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Ample completions of OMs and CUOMs.

[BibT_eX]

[DOI]

CoRR, 2020

Complete Acyclic Colorings.

[BibT_eX]

[DOI]

Winfried Hochstättler

Raphael Steiner

Electron. J. Comb., 2020

Two-Dimensional Partial Cubes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Enumerating k-Arc-Connected Orientations.

[BibT_eX]

[DOI]

Sarah Blind

Algorithmica, 2020

Plattenbauten: Touching Rectangles in Space.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

On the structure of Schnyder woods on orientable surfaces.

[BibT_eX]

[DOI]

Daniel Gonçalves

Benjamin Lévêque

J. Comput. Geom., 2019

Decomposing 4-connected planar triangulations into two trees and one path.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Cuts in matchings of 3-connected cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Computing metric hulls in graphs.

[BibT_eX]

[DOI]

Nicolas Nisse

Discret. Math. Theor. Comput. Sci., 2019

On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs.

[BibT_eX]

[DOI]

Sandi Klavzar

CoRR, 2019

2018

COMs: Complexes of oriented matroids.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

J. Comb. Theory A, 2018

On Lattice Path Matroid Polytopes: Integer Points and Ehrhart Polynomial.

[BibT_eX]

[DOI]

Leonardo Martínez-Sandoval

Jorge Luis Ramírez Alfonsín

Discret. Comput. Geom., 2018

The queue-number of planar posets.

[BibT_eX]

[DOI]

CoRR, 2018

How Many Circuits Determine an Oriented Matroid?

[BibT_eX]

[DOI]

Jorge Luis Ramírez Alfonsín

Comb., 2018

A Tutte polynomial inequality for lattice path matroids.

[BibT_eX]

[DOI]

Leonardo Martínez-Sandoval

Jorge Luis Ramírez Alfonsín

Adv. Appl. Math., 2018

The Queue-Number of Posets of Bounded Width or Height.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Planar Digraphs without Large Acyclic Sets.

[BibT_eX]

[DOI]

Paul S. Wenger

J. Graph Theory, 2017

A correction of a characterization of planar partial cubes.

[BibT_eX]

[DOI]

Rémi Desgranges

Discret. Math., 2017

Cuts in matchings of 3-edge-connected cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Chomp on numerical semigroups.

[BibT_eX]

[DOI]

CoRR, 2017

2016

On the Duality of Semiantichains and Unichain Coverings.

[BibT_eX]

[DOI]

Order, 2016

Orienting Triangulations.

[BibT_eX]

[DOI]

Boris Albar

Daniel Gonçalves

J. Graph Theory, 2016

Three ways to cover a graph.

[BibT_eX]

[DOI]

Discret. Math., 2016

Convexity in partial cubes: The hull number.

[BibT_eX]

[DOI]

Marie Albenque

Discret. Math., 2016

Intersection graphs of L-shapes and segments in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Partial cubes without $Q_3^-$ minors.

[BibT_eX]

[DOI]

CoRR, 2016

Drawing graphs with vertices and edges in convex position.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Graph Drawings with One Bend and Few Slopes.

[BibT_eX]

[DOI]

Bartosz Walczak

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of Delays.

[BibT_eX]

[DOI]

Leonhard Lücken

Jan Philipp Pade

SIAM J. Appl. Dyn. Syst., 2015

Planar digraphs without large acyclic sets.

[BibT_eX]

[DOI]

CoRR, 2015

Structure of Schnyder labelings on orientable surfaces.

[BibT_eX]

[DOI]

Daniel Gonçalves

Benjamin Lévêque

CoRR, 2015

2014

Making Octants Colorful and Related Covering Decomposition Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

On the bend-number of planar and outerplanar graphs.

[BibT_eX]

[DOI]

Daniel Heldt

Discret. Appl. Math., 2014

Edge-intersection graphs of grid paths: The bend-number.

[BibT_eX]

[DOI]

Daniel Heldt

Discret. Appl. Math., 2014

Outerplanar graph drawings with few slopes.

[BibT_eX]

[DOI]

Bartosz Walczak

Comput. Geom., 2014

2013

Making Triangles Colorful.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

News about Semiantichains and Unichain Coverings.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

2011

A graph-theoretical axiomatization of oriented matroids.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Ricardo Strausz

Electron. Notes Discret. Math., 2011

Distributive lattices, polyhedra, and generalized flows.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Cubic time recognition of cocircuit graphs of uniform oriented matroids.

[BibT_eX]

[DOI]

Ricardo Gómez Aiza

Juan José Montellano-Ballesteros

Ricardo Strausz

Eur. J. Comb., 2011

How to eat 4/9 of a pizza.

[BibT_eX]

[DOI]

Discret. Math., 2011

2009

Chip-Firing, Antimatroids, and Polyhedra.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Electron. Notes Discret. Math., 2009

Polynomial Time Recognition of Uniform Cocircuit Graphs.

[BibT_eX]

[DOI]

Ricardo Gómez Aiza

Ricardo Strausz

Electron. Notes Discret. Math., 2009

ULD-Lattices and Delta-Bonds.

[BibT_eX]

[DOI]