Mittagsseminar Discrete Mathematics   📅

Institute
Head
Stefan Felsner
Organizer
Sandro M. Roch
Number of talks
692
Fri, 08.11.24
Burning game
Fri, 28.06.24
Drawings of products of cycles
Fri, 21.06.24
On the maximum diameter of d-dimensional simplicial complexes
Fri, 24.05.24
Signotopes: Pseudoconfigurations and Extensions
Fri, 17.05.24
Saturation results around the Erdős-Szekeres problem
Fri, 03.05.24
Trees in Planar Graphs
Fri, 26.04.24
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl (Wiederholung)
Fri, 19.04.24
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl (Wiederholung)
Fri, 19.04.24
Star-Forest Decompositions of Complete (Geometric) Graphs
Fri, 12.04.24
Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs
Fri, 05.04.24
A balanced Transposition Grey Code for the Symmetric Group and on SCDs for the Permutahedron of Order 5 and below
Fri, 22.03.24
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl
Fri, 01.03.24
Exact covering with unit disks
Fri, 23.02.24
Reconfiguration of plane trees in convex geometric graphs
Fri, 26.01.24
Trees and co-trees in planar graphs
Fri, 12.01.24
Chromatic number is not tournament-local
Fri, 22.12.23
Facet hamiltonian paths in graph associahedra of complete bipartite graphs (and maybe trees)
Fri, 15.12.23
On digons in arrangements of (pseudo)circles
Fri, 01.12.23
On the empty hexagon theorem
Fri, 24.11.23
The Dimension of Products of Orders
Fri, 17.11.23
Plane Hamiltonian cycles and paths in convex drawings
Fri, 10.11.23
Domination of subcubic planar graphs with large girth
Fri, 03.11.23
Coloring problems on arrangements of pseudolines
Fri, 27.10.23
Cops and robber game on surfaces
Fri, 20.10.23
Triangulations and partial triangulations: flips and counting
Fri, 06.10.23
Few Slopes Without Collinearity
Fri, 29.09.23
Edge density of RAC graphs
Fri, 08.09.23
Zählen von Elimination Trees
Fri, 01.09.23
Different embeddings of the Grassmannian, applied to realization problems
Fri, 25.08.23
Facet guarding cycles in graph associahedra
Fri, 28.07.23
Total completion time scheduling under scenarios
Fri, 21.07.23
A new Lemma for proving density bounds of beyond-planar graphs
Fri, 14.07.23
A general lower bound on the mixing time of Glauber dynamics
Fri, 30.06.23
Facet guarding cycles in graph associahedra
Fri, 16.06.23
Geometric representations of signotopes
Fri, 09.06.23
On the connectivity of the flipgraph of pseudoline arrangements
Fri, 02.06.23
Strong Erdős-Hajnal properties in chordal graphs
Fri, 26.05.23
Area Proportionality of Euler diagrams
Fri, 19.05.23
Gons and Holes in Projective Point Sets (Part 2)
Fri, 05.05.23
Block coupling on k-heights
Fri, 28.04.23
Geometrische Realisierbarkeit der Repräsentation von Graphen mit polygonalen Flächen
Fri, 21.04.23
Three nice riddles
Fri, 14.04.23
Partial orders induced by rectangulations
Fri, 24.02.23
SAT encodings for planarity and other graph properties
Fri, 17.02.23
Markov chain methods for nowhere-zero flows
Thu, 16.02.23
Lohnt es sich, längste Ketten zu suchen? – Approximieren von Kettenzerlegungen mit Greedy und First-Fit
Thu, 16.02.23
On the Number of Arrangements of Pseudolines
Fri, 03.02.23
Consecutive pattern-avoidance in Catalan words according to the last symbol
Fri, 27.01.23
On Subdivision Numbers of Triangulations and Equiareality
Fri, 20.01.23
Introduction to Nowhere zero flows
Fri, 13.01.23
Introduction to hyperplane arrangements
Fri, 06.01.23
Plus und Minus: Zur Kombinatorik von Signotopen
Fri, 16.12.22
Hamiltonkreise in Mindestabstandsgraphen in der euklidischen Ebene
Thu, 01.12.22
Completing Partial Generalized Signotopes is NP-hard
Fri, 18.11.22
Isomorphism of point sets
Fri, 11.11.22
The flip-graph of arrangements of pairwise intersecting pseudocircles
Fri, 04.11.22
Holes in Convex Drawings of $K_n$
Fri, 28.10.22
Plane Hamiltonian Cycles in Convex Drawings of $K_n$
Fri, 21.10.22
A Solution to a Problem About Bichromatic Configurations in the Plane
Fri, 14.10.22
Introduction to Cluster Algebras
Wed, 05.10.22
The Air-Pressure Method for Area-Universality
Wed, 28.09.22
Improper colorings of planar graphs
Fri, 23.09.22
Orthogonal convexity
Mon, 12.09.22
Zur Geradeüberdeckungszahl von Graphen
Fri, 02.09.22
Partially ordered sets: structure and compact encoding
Fri, 29.07.22
Odd Hadwiger for line graphs
Fri, 22.07.22
A SAT Attack on Rota's Basis Conjecture
Fri, 22.07.22
Homomorphism complexes and reconfiguration for digraphs
Fri, 08.07.22
Convex tilings with given slopes
Fri, 01.07.22
Graph Drawings with Few Slopes
Fri, 24.06.22
The Hamilton compression of highly symmetric graphs
Fri, 17.06.22
Edge Contraction and Forbidden Induced Subgraph
Fri, 03.06.22
Edge Partitions of Complete Geometric Graphs
Fri, 20.05.22
Unavoidable patterns in complete simple topological graphs
Fri, 13.05.22
Perfect matchings with crossings
Fri, 06.05.22
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Fri, 29.04.22
SAT, ASP, and Symmetry Breaking
Fri, 22.04.22
Constructions in combinatorics via neuronal networks
Fri, 08.04.22
Methods of Hypergraph Containers
Fri, 01.04.22
Matroid depth parameters for integer programming
Fri, 25.03.22
Lions and Contamination
Fri, 18.03.22
Rechts-Links Pfade und ein Kriterium für Planarität
Fri, 25.02.22
Matching Theory, Hamiltonicity, and Barnette's Conjecture
Fri, 18.02.22
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
Fri, 11.02.22
Packness and Tree-Path indices
Fri, 04.02.22
Cycle lengths modulo k in expanders
Fri, 21.01.22
Box graphs with large girth and large chromatic number
Fri, 14.01.22
The Big-Line-Big-Clique Conjecture
Fri, 07.01.22
Colorings of oriented planar graphs avoiding a monochromatic subgraph
Thu, 16.12.21
Algorithms for sampling random pseudoline arrangements
Fri, 10.12.21
Enforceable Drawings of Graphs
Fri, 03.12.21
Asymmetry in Planar Ramsey Graphs
Fri, 26.11.21
Delaunay flips on flat tori
Fri, 19.11.21
Degrees of freedom and the speed of graph classes
Fri, 12.11.21
Star transposition Gray codes for multiset permutations
Fri, 05.11.21
Two notes on relatives of Hadwiger's conjecture
Fri, 29.10.21
Gons and Holes in Projective Point Sets (Part 1)
Fri, 22.10.21
A Sublinear Bound on the Page Number of Upward Planar Graphs
Fri, 01.10.21
Higher Dimensional Signotopes
Fri, 24.09.21
Rechteckzerlegungen und Baxterpermutationen
Fri, 16.07.21
Density of Fan-Planar Graphs
Fri, 09.07.21
Isomorphic bisections of cubic graphs
Fri, 02.07.21
Polynomial bound for divisible subdivisions
Fri, 25.06.21
Listenfärbbarkeit von Arrangement-Graphen
Fri, 18.06.21
Even Circuits in Oriented Matroids
Fri, 11.06.21
Triple Crossing Diagrams (TCDs) and some Posets
Fri, 04.06.21
Counting Plane Partitions - Kuo's proof of the MacMahon formula
Fri, 28.05.21
Generation of elimination trees and Hamilton paths on graph associahedra
Fri, 21.05.21
Disjoint cycles with length constraints in digraphs
Fri, 07.05.21
k-Outerplanarity and Poset Dimension
Fri, 30.04.21
Two extensions of the Erdös–Szekeres problem
Fri, 23.04.21
Unique Sink Orientierungen und Anwendungen
Fri, 16.04.21
Triangles and Lenses in Arrangements of Pseudocircles
Fri, 26.03.21
Zirkuläre chromatische Zahl von zirkulierenden Graphen
Fri, 12.03.21
Actual coloring numbers
Fri, 05.03.21
Zero sum cycles in group-labelled complete digraphs
Fri, 19.02.21
Tight bounds on the expected number of holes in random point sets
Fri, 12.02.21
Flip structures and the 4 color theorem
Fri, 05.02.21
Group testing, Steiner Systems and Reed-Solomon Codes
Thu, 28.01.21
Der Flipgraph von Split und Merge auf Schnyder Woods
Thu, 21.01.21
Queue and Stack Layouts of partial orders
Thu, 14.01.21
Complete minors via dichromatic number
Thu, 07.01.21
A characterization of always solvable trees in Lights Out game and the activation numbers of vertices
Thu, 17.12.20
Towards the Directed Gyarfas-Sumner Conjecture
Thu, 03.12.20
Space-efficient algorithm for the grid graph reachability
Thu, 26.11.20
Crossings in star-simple drawings
Thu, 19.11.20
Zeichnungen vollständiger Graphen und ihre Gap-Planarität
Thu, 12.11.20
Drawings of acyclic digraphs: Algorithmic aspects
Thu, 05.11.20
Edge-Minimum Saturated k-Planar Drawings (of Multigraphs)
Thu, 29.10.20
3-Coloring Arrangements of Great-Circles: Partial Results
Thu, 15.10.20
A lower bound of the number of independent hyperplanes in oriented paving matroids
Thu, 08.10.20
Partition algorithms for weighted cactus graphs
Fri, 02.10.20
Crossing-critical graphs, the bounded degree conjecture and the number 13
Thu, 17.09.20
The chromatic polynomial of a digraph
Mon, 07.09.20
On deletion-perfect families of permutations
Fri, 04.09.20
Computing Shapley values and elements from the core
Thu, 27.08.20
Towards a Proof of the Removable Pair Conjecture
Thu, 20.08.20
Not all planar graphs are in PURE-4-DIR
Thu, 13.08.20
On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
Thu, 09.07.20
On flips in planar matchings
Thu, 02.07.20
On the Number of Order Types
Thu, 18.06.20
Neighborhood polynomial in chordal graphs
Fri, 12.06.20
Subdivisions in dense digraphs
Fri, 05.06.20
Sparse Ordered Ramsey Graphs
Fri, 29.05.20
A better approximation for the longest non-crossing spanning tree of a point set
Thu, 21.05.20
Bundeling crossings of strings
Thu, 14.05.20
Dynamics of Cycles in Polyhedra I: The Isolation Lemma
Thu, 07.05.20
Representing Graphs by Polygons with Side Contacts in 3D
Thu, 30.04.20
Strongly Pfaffian Graphs
Thu, 23.04.20
7-gons in 3-space meet cadical
Fri, 17.04.20
Enumeration of topological drawings of K_n
Thu, 09.04.20
Pseudolinear Drawings
Thu, 02.04.20
Adjacency Labelling for Planar Graphs (and Beyond)
Thu, 12.03.20
Dichromatic number and forbidden subdivisions
Thu, 20.02.20
Zur Kombinatorik von Stick-Graphen
Thu, 13.02.20
Fast Computation of Chirotopes
Thu, 30.01.20
3-face colorings and Tutte's 3-flow conjecture
Thu, 23.01.20
Combinatorial properties of topological drawings of complete graphs
Thu, 16.01.20
Remarks on Plattenbauten
Thu, 19.12.19
Another Brick in the Wall
Thu, 12.12.19
Superpermutations And Super-Patterns
Wed, 27.11.19
Enumerating and Counting Pseudoline Arrangements
Thu, 14.11.19
The central levels problem and symmetric chains in the hypercube
Thu, 07.11.19
What does the Cyclic Polytope have to do with Terrain Visibility Graphs?
Thu, 31.10.19
Simple Topological Drawings, Rotation Systems, and SAT Solvers
Thu, 24.10.19
Holes and islands in random point sets
Thu, 17.10.19
Bichains - 7 equivalent formulations
Fri, 04.10.19
Majority Colourings of Sparse Digraphs
Thu, 26.09.19
Graphs without long ladder minors
Mon, 16.09.19
Verallgemeinerte Permutaeder und Hopf-Monoide
Mon, 09.09.19
Straight-line-triangle-representstions und ihre Berechnung
Fri, 06.09.19
Circle graphs are quadratically chi-bounded
Tue, 13.08.19
Sortieren in Netzwerken aus Stacks und Queues
Fri, 12.07.19
Flip Graphs, Topological Drawings and Separable Permutations
Fri, 05.07.19
Weak coloring numbers of planar graphs
Fri, 28.06.19
Spherical Thrackles and Conway's Conjecture
Fri, 14.06.19
Counterexamples to Hedetniemi's Conjecture
Fri, 31.05.19
Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
Fri, 24.05.19
Planar point sets determine many pairwise crossing segments
Fri, 17.05.19
Counting Linear Extensions
Thu, 09.05.19
Generating k-connected orientations
Fri, 03.05.19
Odd Dijoins and Cut Minors
Fri, 03.05.19
Universelle Wörter mit Jokersymbolen
Fri, 26.04.19
Bishellable Drawings of K_n
Thu, 18.04.19
Geschichtete Separatoren und ihre Anwendungen
Fri, 12.04.19
Universal point sets for planar 3-trees
Fri, 05.04.19
Segment intersection representations of planar graphs
Fri, 29.03.19
Combinatorial generation via permutation languages
Fri, 22.03.19
Planar graphs have bounded queue-number
Fri, 15.03.19
Universal Point Sets for Planar Graphs
Fri, 01.03.19
A Generalization of the Erdős-Szekeres Theorem to Arrangements of Pseudocircles
Fri, 22.02.19
A Combinatorial Extension of the Colorful Carathéodory
Fri, 15.02.19
Colouring Non-Even Digraphs
Fri, 08.02.19
On Cayley Graphs Generated by Permutations and Shifts
Fri, 01.02.19
On the Generalized Middle Levels Problem
Fri, 18.01.19
On Woodall's Conjecture, Cyclic Base Orderings, Fractional Arboricity and Pseudosphere Arrangements
Fri, 11.01.19
On Erdős-Szekeres Type Questions in $R^d$
Fri, 14.12.18
The Sierpinski product of graphs
Fri, 30.11.18
Flip Distances between Graph Orientations
Fri, 16.11.18
Using SAT Solvers in Combinatorics and Geometry
Fri, 09.11.18
On the extendability of non-degenerate box configurations to tilings
Fri, 02.11.18
Metric Colourings of Graphs
Thu, 04.10.18
Two Fundamentally Important Problems for Planar Posets
Fri, 07.09.18
Recoverable Robust Discrete Optimization
Fri, 31.08.18
L-shaped Point Set Embeddings of Trees
Thu, 23.08.18
Star Dichromatic Number
Fri, 17.08.18
On grounded L-graphs and their relatives
Tue, 24.07.18
Kreise für planare Matchings
Fri, 20.07.18
On Erdős-Szekeres-type problems for k-convex point sets
Tue, 10.07.18
Multi-Level Steiner Tree
Fri, 29.06.18
Variationen über "Crossing Families"
Fri, 22.06.18
Convexity increasing morphs of planar graphs
Fri, 15.06.18
Stand der Wissenschaft zur Borsuk-Vermutung und Max-Distance-Graphen
Fri, 25.05.18
The Combinatorial Nullstellensatz and List Edge Colorings of Graphs
Fri, 18.05.18
Zerlegungen des Hyperwürfels in symmetrische Ketten
Fri, 11.05.18
Zerlegungsgleichheit und die Dehn'sche Invariante
Fri, 04.05.18
Arrangements of Pseudocircles: Triangles, Drawings, and Circularizability
Fri, 27.04.18
Zur Komplexität von Sechseckskontaktdarstellungen
Fri, 20.04.18
A routing problem in arrangements with applications
Fri, 13.04.18
On a crossing lemma for multigraphs
Fri, 06.04.18
Partial Least-Squares Point Matching under Translations
Thu, 29.03.18
Faster Algorithms for some Optimization Problems on Collinear Points
Thu, 15.03.18
Minimal Geometric Graph Representations of Order Types
Thu, 01.03.18
Kontaktdarstellungen planarer Graphen mit Fünfecken
Fri, 23.02.18
Alternating permutations, Euler numbers and some bijections
Fri, 16.02.18
Area-universality of triangulations
Fri, 09.02.18
Universal slope sets for 1-bend planar drawings
Fri, 26.01.18
Discrepancy of axis-parallel boxes
Fri, 19.01.18
Approaching area-universality
Fri, 12.01.18
Introduction to Placements of Rooks
Fri, 08.12.17
Measures of depth for multiple points
Fri, 01.12.17
Planar graphs as L-intersection graphs
Fri, 24.11.17
Planar graphs as L-contact graphs
Fri, 17.11.17
Neumann-Lara-flows and the Two-Colour-Conjecture
Fri, 10.11.17
Extending Partial Representations of Trapezoid Graphs
Fri, 03.11.17
More about Circle- and Pseudocirclearrangements
Fri, 27.10.17
Rechteckszerlegungen auf Punktmengen
Fri, 20.10.17
Zu Kodierung und Kreisbarkeit von Pseudokreisarrangements
Fri, 13.10.17
On the Monge-Kontorovich transportation problem and Voronoi diagrams
Fri, 06.10.17
Applications of a topological lemma in combinatorial geometry (circle packing, floorplans)
Fri, 22.09.17
A short proof of the middle levels theorem
Fri, 28.07.17
The chip firing game
Fri, 21.07.17
Towards the Harary Hill conjecture
Fri, 16.06.17
Maximum-area triangle in a convex polygon
Fri, 02.06.17
Maximum crossing number of cycles and bipartite graphs
Wed, 24.05.17
Area-universal rectangular layouts
Fri, 19.05.17
SageMath - Eine Kurzeinführung
Fri, 05.05.17
Optimal Coding and Sampling of Triangulations
Thu, 27.04.17
Flipping Edges of Triangulations
Fri, 21.04.17
The Art Gallery Problem is $\exists \mathbb{R}$-complete
Fri, 21.04.17
Stretching weighted pseudoline arrangements
Fri, 31.03.17
Area-universality and $\forall\exists\mathbb R$ (\FER)-hardness
Fri, 24.03.17
Morphing Schnyder drawings of plane triangulations
Fri, 03.03.17
A superlinear lower bound on the number of 5-holes
Fri, 24.02.17
Sortieren mit partieller Information
Fri, 17.02.17
On lattice path matroid polytopes: integer points and Ehrhart polynomial
Fri, 10.02.17
Orthogonal tree decompositions and chromatic number
Fri, 03.02.17
Triangles in Arrangements
Fri, 27.01.17
Topologische Zeichnungen bipartiter Graphen
Fri, 20.01.17
Trees and Circle Orders
Thu, 15.12.16
Equidissections of polygons
Fri, 09.12.16
Squarability of rectangle arrangements
Wed, 30.11.16
Deciding monotonicity of complete topological graphs
Fri, 25.11.16
On the boxicity of graphs with no K_t minor
Fri, 18.11.16
Circle- and Pseudocirclearrangements
Thu, 03.11.16
Efficient algorithm for computing middle level Gray codes
Fri, 14.10.16
Popular matchings
Fri, 07.10.16
Coloring, sparseness, and girth
Thu, 11.08.16
Maximizing the Sum of Radii of Disjoint Balls or Disks
Fri, 05.08.16
Coloring Segments in Space
Fri, 22.07.16
Rechtecks-Duale mit vorgegebenen Flächen
Fri, 08.07.16
Two double poset polytopes
Fri, 24.06.16
Visibility Graphs of Geometric Objects
Mon, 20.06.16
Dominating Sets in Sparse Graphs
Fri, 10.06.16
Union-closed set conjecture
Fri, 03.06.16
How to morph planar graph drawings
Fri, 20.05.16
Existenz und Konstruktion von Dreiecks- und Fünfeckskontaktdarstellungen
Thu, 19.05.16
Magische Eigenschaften von Graphen
Fri, 13.05.16
On the Erdős-Szekeres convex polygon problem
Wed, 04.05.16
Centered colorings and order dimension
Fri, 29.04.16
q-Catalan Zahlen
Fri, 22.04.16
A Geometric Approach to Acyclic Orientations
Mon, 18.04.16
Decomposing graphs into trees
Fri, 18.03.16
On Graphs that have the Erdos-Posa Property
Fri, 04.03.16
De Bruijn Graphen mit Eulerkreisen als Ansatz für DNA Fragment Assembly
Fri, 26.02.16
Embedding Graphs on Wheel Point Sets.
Fri, 19.02.16
k-lokal planare Graphen
Fri, 05.02.16
Ein neuer Existenzbeweis für Kontaktdarstellungen mit homothetischen gleichseitigen Dreiecken.
Thu, 28.01.16
Improved bounds for the dimension of posets whose cover graphs have bounded treewidth.
Fri, 22.01.16
Posets and Dimension
Fri, 08.01.16
Coloring Graphs on Surfaces.
Fri, 18.12.15
An Approximation Algorithm and Parameterized Hardness of the Art Gallery Problem
Fri, 11.12.15
Square Dissections and Transversal Structures.
Fri, 04.12.15
Semi-bar 1-visibility graphs.
Fri, 27.11.15
Polygon obstacle representations of graphs.
Fri, 20.11.15
Kontakt- und Schnittdarstellungen planarer Graphen.
Fri, 13.11.15
Drawings of K_{r,n}.
Fri, 30.10.15
Drawing planar graphs with prescribed face areas.
Fri, 23.10.15
Graphs with locally bounded treewidth.
Fri, 16.10.15
The slope number of graphs.
Thu, 08.10.15
Strongly monotone drawings of planar graphs.
Fri, 02.10.15
Bipartite Kneser graphs are Hamiltonian.
Fri, 25.09.15
An algorithm for square contact representations.
Fri, 18.09.15
Points in the plane and depth.
Tue, 08.09.15
The dimension of planar posets.
Fri, 28.08.15
Illumination of polygons with vertex lights.
Fri, 21.08.15
Arrangements of Pseudolines on Dual Arrangements
Thu, 13.08.15
Counting annular non-crossing matchings.
Fri, 17.07.15
Queue layouts of graphs with bounded treewidth.
Fri, 10.07.15
Slope minimization of segment intersection graphs.
Fri, 03.07.15
Drawings of K_{2,n}.
Fri, 19.06.15
Partial Bar Visibility Representation Extension.
Fri, 12.06.15
Rainbow Connectivity
Fri, 05.06.15
Visibility graphs of pseudo-polygons.
Thu, 28.05.15
Drawing graphs with vertices and edges in convex position
Wed, 13.05.15
Sparsity and dimension.
Fri, 08.05.15
Classes of graphs with bounded expansion: examples and characterizations.
Fri, 24.04.15
1:d-Graphen: Eine Verallgemeinerung planarer Triangulierungen.
Fri, 17.04.15
Hook-formulae
Fri, 10.04.15
Intersection Graphs of Non-Crossing Paths.
Thu, 26.03.15
Chromatic Art Gallery Problem
Fri, 13.03.15
Catching light rays with mirrors
Fri, 06.03.15
A new proof for the Aztec diamond theorem.
Fri, 27.02.15
Computing dimension of bounded width posets
Fri, 20.02.15
Crossing Numbers and Rotation Systems
Fri, 13.02.15
Power line route optimization.
Fri, 06.02.15
Drawing the Complete Graph with a Planar Subgraph
Fri, 30.01.15
Obstacle Representations of Graphs
Fri, 16.01.15
Long Paths in Line Arrangements
Fri, 09.01.15
Posets and minors.
Fri, 12.12.14
Dimension and Standard Examples
Fri, 05.12.14
The list chromatic index of 1-factorable graphs.
Fri, 05.12.14
Topologische Bucheinbettungen planarer Graphen.
Fri, 28.11.14
Independent and hitting sets of some classes of rectangle intersection graphs.
Fri, 21.11.14
Overlap Representations of Planar Graphs
Fri, 14.11.14
Point visibility graphs and the existential theory of the reals.
Fri, 31.10.14
Orienting Triangulations.
Fri, 24.10.14
Refined counting of linear extensions of posets.
Thu, 23.10.14
Würfelkonstaktdarstellungen von Graphen
Fri, 19.09.14
On-line coloring between two lines.
Fri, 22.08.14
Representations of point visibility graphs.
Fri, 15.08.14
Token Swapping
Fri, 08.08.14
Large dimensional posets with planar cover graphs
Fri, 01.08.14
On the complexity of recognizing unit proper contact graphs of unit regular polygons.
Fri, 25.07.14
Clique Separators in Neighbourhood Subtree Intersection Graphs
Fri, 11.07.14
Touching Triangle Representations of Biconnected Outerplanar Graphs
Fri, 27.06.14
Pathwidth and nonrepetitive colorings of graphs
Fri, 20.06.14
Abstract Ham-Sandwich Cuts and Selection in Arrangements
Fri, 06.06.14
Kombinatorische Eigenschaften von bichromatischen Punktmengen und Arrangements.
Wed, 28.05.14
(Pseudo) Vertex-Edge Visibility Graphs in Polygons.
Fri, 23.05.14
Intersection graphs of unit squares and partial grid graphs
Thu, 22.05.14
Durchmesser von höheren symmetrischen Shift-Graphen
Mon, 19.05.14
Balanced Pairs in Sets of Orderings with many initial Elements
Fri, 02.05.14
Generating and counting perfect matchings in bipartite regular graphs
Fri, 25.04.14
The Complexity Class 'Polynomial-Time Local Search' (PLS)
Thu, 17.04.14
On (K_{1,3},even-hole)-free graphs.
Fri, 11.04.14
On Area-Universal Contact Representations with Orthogonal Polygons.
Fri, 04.04.14
Grid-Path Contact Representations.
Fri, 28.03.14
Slopes of bipartite segment intersection graphs.
Fri, 21.03.14
Counting triangulations and related structures.
Fri, 14.03.14
Lower bounds for on-line graph colorings
Fri, 07.03.14
Opaque forests
Fri, 28.02.14
Bookembeddings and topological bookembeddings
Fri, 14.02.14
On the Dimension of Posets that do not have a large Standard Example as a subposet.
Fri, 07.02.14
Graph Traversals and Restricted Families of Graphs
Fri, 31.01.14
Counting singletons and related structures
Fri, 24.01.14
On unit distance graphs.
Fri, 17.01.14
Triangle contact representation of a planar graph and its dual.
Fri, 10.01.14
On the number of edges in families of pseudo-discs
Fri, 20.12.13
Slopes of k-dir graphs.
Fri, 13.12.13
Graceful labelings of graphs
Fri, 06.12.13
On the Dimension of Posets that have a Cover Graph of bounded Treewidth
Fri, 29.11.13
Connected Covering Numbers.
Fri, 22.11.13
Methoden zur Berechnung von Tabellenkartogrammen
Fri, 22.11.13
Basics of Multitriangulations.
Fri, 15.11.13
Making Octants Colorful
Fri, 01.11.13
Slanted Orthogonal Drawings.
Fri, 25.10.13
A (q-analogon)^2 for the number of bounded Motzkin paths.
Thu, 17.10.13
Anwendungen der Entladungsmethode
Thu, 17.10.13
Layer Aware Codes
Fri, 11.10.13
Plane Cubic Graphs and the Air-Pressure Method
Fri, 04.10.13
Evaluating Determinants Combinatorially
Fri, 20.09.13
Extending partial representations of circle graphs
Thu, 12.09.13
Gradsequenzen von gerichteten Graphen.
Fri, 06.09.13
Henneberg Steps for Triangle Representations
Fri, 30.08.13
An order-theoretic generalization of Polya's enumeration theorem
Fri, 23.08.13
Untangling two systems of non-crossing curves
Fri, 26.07.13
For some $\alpha$ the face flip markov chain on the set of $alpha$-orientations is not rapidly mixing on planar triangulations of degree \leq 7
Fri, 19.07.13
Unit Interval Graphs and Balanced Pairs
Fri, 12.07.13
Decompositions of optimal 1-planar graphs
Wed, 03.07.13
Generalized Schnyder woods and box contact graphs in higher dimensions
Fri, 28.06.13
On the queue and track number of planar graphs
Wed, 26.06.13
Acyclic Coloring with Few Division Vertices
Fri, 21.06.13
Counting edges of linear extension graphs
Fri, 14.06.13
On visibility and k-visibility graphs
Fri, 07.06.13
Interval Dimension and Bipartite Graphs
Fri, 31.05.13
GIGs and Dimension
Tue, 28.05.13
Die Max-Algebra und ihre Anwendung in der Graphentheorie und Optimierung
Fri, 17.05.13
Not all (2,2)-tight graphs have an L-Contact representation, nor an L-Contact representation allowing degenerate L-shapes.
Thu, 16.05.13
Ein Luftdruckparadigma zur Optimierung von Zerlegungen
Tue, 07.05.13
Hook Graphs and More
Fri, 03.05.13
On a Geometric Partitioning Problem.
Fri, 26.04.13
On the Recognition of Orthogonal Ray Graphs
Fri, 19.04.13
Von perfekten Matchings zu stabilen Hochzeiten
Fri, 19.04.13
Hall Bedingung für Hypergraphen
Fri, 12.04.13
The Balanced Pair Conjecture for Antimatroids
Fri, 05.04.13
Clique Minimal Separator Decomposition and Intersection Graphs of Trees in a Cactus.
Thu, 28.03.13
Algebraische obere Schranken für Codes
Fri, 22.03.13
The face flip markov chain is rapidly mixing on 2-orientations of plane quadrangulations of maximum degree 4
Fri, 15.03.13
Straight Line Triangle Representations
Fri, 08.03.13
Orthogonal Ray Graphs and Trees
Fri, 01.03.13
Domino Tilings auf dem Torus.
Fri, 22.02.13
Extremal Graphs Having No Independent Cutsets
Fri, 15.02.13
Table Cartograms
Fri, 18.01.13
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) colors.
Fri, 11.01.13
The Shannon capacity of C_5
Fri, 14.12.12
A characterisation of Generic Circuits.
Fri, 07.12.12
Efficient representations of unit grid intersection graphs
Fri, 30.11.12
Geometric graphs with few disjoint edges
Fri, 23.11.12
Exploiting Air-Pressure to Map Floorplans on Point Sets
Fri, 09.11.12
Betweenness
Fri, 02.11.12
Partial Cubes: Lattices and Topology
Fri, 26.10.12
Recognition of Simple-Triangle Graphs and Linear-Interval Orders is Easy
Fri, 19.10.12
Orders induced by segments in floorplans, and (2-14-3, 3-41-2)-avoiding permutations
Fri, 12.10.12
Arithmetic of marked order polytopes and monotone triangle reciprocity
Fri, 28.09.12
Unique Bichromatic Matchings
Fri, 21.09.12
Coloring rectangle intersection graphs
Fri, 31.08.12
Eigensequences; Kirchhoff and Graphs
Thu, 30.08.12
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy
Tue, 28.08.12
The Intersection of Tolerance and Cocomparability Graphs
Fri, 24.08.12
Compatible matchings and planar straight line graphs
Fri, 10.08.12
The jump number of 2-directional orthogonal ray graphs
Fri, 22.06.12
Straight Line Triangle Representation of a Graph
Fri, 08.06.12
Covering partial cubes with cuts
Fri, 01.06.12
L-Contact and Segment-Contact is the same
Fri, 25.05.12
Drawing outerplanar graphs with few slopes
Fri, 11.05.12
Conductance, congestion and canonical paths of Markov chains
Fri, 04.05.12
A note on proportional contact representations
Wed, 02.05.12
Recognition of Simple Triangle Graphs
Fri, 27.04.12
Unit grid intersection graphs: Properties and relationships to other graph classes
Fri, 13.04.12
Graph Sharing Games
Fri, 30.03.12
Cyclic segment graphs and diagonal hook graphs
Wed, 28.03.12
Chromatic Invariants of Shift Graphs and Kneser Graphs
Fri, 16.03.12
The chromatic number of geometric intersection graphs
Fri, 17.02.12
How many bends for one additional direction?
Fri, 10.02.12
The distance geometry for the kissing balls
Fri, 27.01.12
The dimension of posets with outerplanar cover or planar comparability graphs
Fri, 20.01.12
Constellations and multicontinued fractions: application to Eulerian triangulations
Fri, 13.01.12
The graphs that can be drawn with one bend per edge
Fri, 06.01.12
Matchings that yield 'good' triangle representations
Fri, 16.12.11
2-Directional Orthogonal Ray Graphs
Fri, 02.12.11
Labellings and decompositions of planar and toroidal quadrangulations
Fri, 25.11.11
The upper bound for separated matchings
Fri, 18.11.11
Three families of graphs with bad conductance for the face-flip Markov chain on α-orientations
Fri, 28.10.11
Computing numbers with balls and urns
Fri, 21.10.11
Weak conflict free colourings
Fri, 14.10.11
The hull number of partial cubes
Fri, 07.10.11
Crossing-free curves within pseudodiscs
Wed, 28.09.11
Generalization of Dilworth's Theorem and Semiantichain Conjecture
Fri, 23.09.11
Squaring the Torus
Fri, 16.09.11
The Group Theory of Spinpossible
Wed, 14.09.11
Jump number(s) of partially ordered sets
Wed, 07.09.11
Rhombische Pflasterungen von Dreiecken
Wed, 24.08.11
Sampling Schnyder-woods of planar triangulations with max degree ≤6
Tue, 23.08.11
Graphs that yield safe communication schemes
Wed, 17.08.11
The Tron Problem
Wed, 10.08.11
Planar maps and continued fractions
Wed, 20.07.11
Cayley graphs of semigroups
Wed, 13.07.11
How to compute a squaring?
Wed, 06.07.11
Trapezoidal dissections and Markov chains
Wed, 29.06.11
Proportional Contact Representations with Rectilinear Polygons
Wed, 22.06.11
Zeichnen von Ordnungen; Eine Experimentalstudie
Wed, 08.06.11
Introducing the bar visibility number of a graph
Wed, 18.05.11
Tolerance graphs as trapezoid graphs and NP-completeness
Wed, 11.05.11
On the enumeration of simple symmetric quadrangulations
Wed, 04.05.11
Groebner bases for order theorists
Wed, 27.04.11
Planar Posets and Dimension 2
Wed, 20.04.11
Crossing a bridge at night
Wed, 13.04.11
A graph-theoretical axiomatization of oriented matroids
Wed, 16.03.11
On Rectangle Contact Representations
Wed, 09.03.11
The Colin de Verdiere Graph Parameter
Wed, 02.03.11
Pflasterung orthogonaler Polygone mit Rechtecken
Wed, 23.02.11
Contact Representations of Planar Graphs with Weights
Wed, 16.02.11
The Isometric Dimension of Median Graphs via a Generalization of Birkhoff's Representation Theorem
Wed, 09.02.11
A bijection between fractional trees and pentagulations of girth 5
Wed, 26.01.11
Dissections of polygons and the cylinder into triangles of equal areas
Wed, 19.01.11
Grid Intersection Graphs
Wed, 12.01.11
Contact representations of planar graphs with cubes
Wed, 05.01.11
Online Coloring of Bounded-Tolerance Graphs
Wed, 15.12.10
On the crossing number of complete and complete bipartite graphs
Wed, 08.12.10
Some remarks on the behavior of a local operating Markov chain on the set of k-heights
Wed, 24.11.10
Planar posets and dimension
Wed, 10.11.10
Line arrangements and geometric graph classes
Wed, 03.11.10
The class of segment graphs
Wed, 22.09.10
d-Schnyder structures
Wed, 25.08.10
CAT-Enumeration of the Ideals of a Planar Poset
Wed, 21.07.10
Square Tilings and Extremal Length
Wed, 14.07.10
A glimpse at the kernel method and Knuth's approach to the ballot problem
Wed, 23.06.10
Linear extension diameter of subposets of Boolean lattice induced by two levels
Wed, 09.06.10
Konstruktion elliptischer Kurven mit vorgegebener Ordnung
Wed, 19.05.10
Lattices and Set Systems
Wed, 12.05.10
Transitive orientation and vertex partitioning
Wed, 05.05.10
Walking on a path (with loops) II
Wed, 28.04.10
Punkte mit grosser Quadrantentiefe
Wed, 21.04.10
Coroutines and Hamiltonian Paths in Lattices
Wed, 14.04.10
Abzählprobleme für Pfade im Gitterstreifen
Wed, 31.03.10
Enumerating all Ideals of a Poset - Some Special Cases
Wed, 24.03.10
How far is a graph from being an interval graph?
Wed, 17.03.10
Edge-intersection graphs of grid paths
Wed, 10.03.10
Triangle contact representations of plane graphs
Wed, 03.03.10
Hyperbolic graphs, fractal boundaries, and graph limits
Wed, 24.02.10
Antichains of (k+k)-free posets
Wed, 17.02.10
On-line dimension of orders
Wed, 10.02.10
Parity in graph sharing games
Wed, 03.02.10
On the Size of Maximal Antichains and the Number of Pairwise Disjoint Maximal Chains
Wed, 27.01.10
One way to generalize interval graphs: edge-intersection graphs of elbows in the plane grid
Wed, 20.01.10
Generalizing the order polytope
Wed, 13.01.10
Walking on a path (with loops) I
Wed, 06.01.10
Neues zum Satz von Hanani und Tutte
Fri, 18.12.09
Funktionales Denken im propädeutischen Analysisunterricht - Ansätze und empirische Befunde zu einem qualitativen Zugang durch Computereinsatz II
Wed, 16.12.09
Funktionales Denken im propädeutischen Analysisunterricht - Ansätze und empirische Befunde zu einem qualitativen Zugang durch Computereinsatz I
Wed, 09.12.09
Lower bounds for on-line chain partitioning
Wed, 02.12.09
A subexponential upper bound for the on-line chain partitioning problem
Wed, 25.11.09
Coding and Counting Arrangements of Pseudolines
Wed, 18.11.09
The Balloon Popping Problem
Wed, 11.11.09
Planar Bipartite Posets
Wed, 04.11.09
Sensitivity of 3-heights on a path
Wed, 21.10.09
Points with Some Quadrant Depth
Wed, 14.10.09
Polynomial Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids
Wed, 07.10.09
Enumerating all Ideals of a Poset
Wed, 30.09.09
Squarings of Quadrangulations
Wed, 16.09.09
A failed construction of the multiassociahedron
Wed, 02.09.09
Swap Colors in Linear Extension Graphs
Wed, 05.08.09
Layer decomposition of planar graphs
Wed, 22.07.09
Reconstruction of Pedigrees
Wed, 15.07.09
Kernels and Sperner's Lemma
Wed, 08.07.09
Computational aspects of mixing heights
Wed, 01.07.09
Topological representations of planar partial cubes
Wed, 24.06.09
Antimatroids, Polytopes and ULDs
Wed, 17.06.09
(Linear) Induced Forests in Planar Graphs
Wed, 10.06.09
Condorcet Domains and Arrangements of Pseudolines
Wed, 03.06.09
On Triconnected and Cubic Plane Graphs on Given Point Sets
Wed, 27.05.09
Rectangular layouts: associated graphs and constructions.
Wed, 13.05.09
Curry-Hähnchen zu Mittag (An Introduction to Curry-Howard and the Coq Proof-Assistant)
Wed, 06.05.09
Root Systems and Generalized Associahedra
Wed, 29.04.09
Adjacency Posets
Wed, 22.04.09
Convex Partitions of the Permutahedron
Wed, 15.04.09
Constraint Satisfaction and Category Theory: Constructing Tractable Templates
Wed, 25.03.09
A Short Introduction to Block Cipher Algorithms
Wed, 18.03.09
Graph Homomorphisms and Reflection Positivity
Wed, 11.03.09
On Quadrant-Depth - Closing the Gap
Wed, 04.03.09
Compactness proofs for infinite graphs
Wed, 25.02.09
On Quadrant-Depth
Wed, 18.02.09
Generalized Chip Firing
Wed, 11.02.09
Linear Extension Diameter of Boolean Lattices
Wed, 28.01.09
Sorting Pairs in Bins, aka 'Das Krawattenraetsel'
Wed, 21.01.09
On the number of non-decreasing paths in grid graphs
Wed, 14.01.09
Yet Another Way of Counting Planar Graphs
Wed, 07.01.09
Avaloqix is strongly PSPACE-hard
Wed, 17.12.08
Self-Assembling Tilings, Orders and Signal Systems
Wed, 10.12.08
Covering Graphs by Colored Stable Sets
Wed, 03.12.08
Bipartite Graphs and Basic k-Covers
Wed, 26.11.08
A Reason Why Avaloqix Could Be 'Interesting' (i.e. NP-hard)
Wed, 19.11.08
An Algebraic Characterization of Planar Graphs
Wed, 12.11.08
The Boolean Lattice and its Linear Extension Diameter
Wed, 05.11.08
Characterization of Maps with Order Dimension at most 2
Wed, 29.10.08
Partitioning Boolean Lattices into Intervals
Wed, 22.10.08
Efficient packing via game coloring
Wed, 15.10.08
How to Eat 4/9 of a Pizza
Wed, 08.10.08
Avaloqix - A Max Flow Game
Wed, 10.09.08
Online Dimension of Semi-Orders with Representation
Wed, 03.09.08
Some Open Problems We Like
Wed, 30.07.08
Tutte's Flow Conjectures and Berlekamp's Switching Game
Wed, 16.07.08
Evolution on distributive lattices
Wed, 09.07.08
Distributive polyhedra and related problems on weighted parameterized graphs
Wed, 02.07.08
Cycles and Bicycles in Locally Finite Graphs II
Wed, 25.06.08
Voting Caterpillars
Wed, 18.06.08
Cycles and Bicycles in Locally Finite Graphs I
Wed, 11.06.08
A connection between Ramsey number and chromatic number
Wed, 04.06.08
LINEAR EXTENSION DIAMETER is NP-complete
Wed, 28.05.08
Random Walks and Search Problems
Wed, 21.05.08
Inducing Polygons of Line Arrangements
Wed, 14.05.08
Linear Extensions in Diametral Pairs Don't Have to Be Reversing
Wed, 30.04.08
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Wed, 23.04.08
Mr. Paint and Mrs. Sandpaper
Wed, 16.04.08
Linkages in Polytope Graphs
Wed, 09.04.08
Permutohedra, Semigraphoids, and Mice
Wed, 19.03.08
Hamiltonicity Properties of Arrangement Graphs
Wed, 12.03.08
On Frankl's Conjecture
Wed, 05.03.08
k-Segments in Arrangements of Pseudolines
Wed, 27.02.08
Distributed Computation of Virtual Coordinates
Wed, 20.02.08
Markov Chains and the Second Eigenvalue
Wed, 13.02.08
The Spectrum of a Graph
Wed, 06.02.08
Foldings and the Topology of Graph Homomorphisms
Wed, 30.01.08
Reconstructing Posets from Linear Extension Graphs
Wed, 23.01.08
A Distributive Lattice on Pseudo-Flows
Wed, 16.01.08
Counting Paths in Cube Configurations
Wed, 09.01.08
A Polynomial Time Algorithm for Finding Fullerene Patches
Fri, 21.12.07
Polyhedral Methods for Linear Extensions of Partial Orders
Wed, 12.12.07
The Dictator Paradox
Wed, 05.12.07
Sorting Using Networks of Stacks and Queues
Wed, 28.11.07
Leafy Trees in Planar Graphs
Wed, 21.11.07
How to Draw an Order
Wed, 14.11.07
Dimension Of Orders via Constraint Programming
Wed, 07.11.07
Greedy Drawings of Planar Triangulations
Wed, 31.10.07
k-Level Complexity of Arrangements of (Pseudo-)Segments
Wed, 24.10.07
Construction of Steiner Triple Systems
Wed, 17.10.07
Recognition and Optimization Problems on Geometric Intersection Graphs
Wed, 10.10.07
Weak Conflict-Free Colorings of Point Sets and Simple Regions
Fri, 28.09.07
Turan's Theorem for Multipartite Graphs
Wed, 19.09.07
Compact Drawings with Bends
Wed, 05.09.07
Partitioning Posets
Wed, 29.08.07
Matchings and Edge Colorings in Regular Graphs
Wed, 08.08.07
Unavoidable Minors of c-connected Graphs
Wed, 01.08.07
2-Arrangements of Pseudolines
Wed, 25.07.07
Leafy Trees
Wed, 18.07.07
A bijection between loopless maps and triangulations
Wed, 11.07.07
Digital Geometry
Wed, 04.07.07
Infeasibility of Arrangements
Wed, 27.06.07
On-line Dimension of Intervals
Wed, 20.06.07
On-line Colouring of Intervals
Wed, 13.06.07
Bijective Countings of Tree-Rooted Maps
Wed, 06.06.07
Planar Graphs are in 1-STRING
Wed, 23.05.07
On-line chain partitions of up-growing 2-dimensional orders
Wed, 16.05.07
Perlenketten mit Quoten
Wed, 09.05.07
Diametral Pairs of Linear Extensions of a Poset
Wed, 02.05.07
Hardness of Counting Orientations with Fixed Out-Degrees
Wed, 25.04.07
Was ist ein semidefinites Programm?
Wed, 18.04.07
Compass Routing
Wed, 11.04.07
Pseudo-Connections in the Plane
Wed, 04.04.07
Triangle Contact Representations of Graphs
Wed, 21.03.07
Random sampling in distributive lattices
Wed, 07.03.07
Online Ramsey Theory
Wed, 31.01.07
2-Dimensional Partial Orders Revisited
Wed, 24.01.07
Counting Planar Eulerian Orientations is #P-complete
Wed, 17.01.07
How Many 3-Pseudosegments can a Pseudoline Arrangements have?
Wed, 10.01.07
The Crossing Number of Geometric Complete Graphs
Wed, 20.12.06
Arrangements of pseudolines; news, problems, and goodies.
Wed, 13.12.06
α-Orientations and Regular Oriented Matroids
Wed, 06.12.06
α-Orientations and FlipFlops
Wed, 29.11.06
Kombinatorik orthogonaler Flächen
Wed, 22.11.06
α-Orientations and Bipartite Perfect Matchings
Wed, 15.11.06
Constraint Programming
Wed, 01.11.06
On Complicacy of Graphs Representable by Polygons
Wed, 25.10.06
Spezialfälle der 'list edge coloring conjecture'
Wed, 18.10.06
Baxter and Schröder Families
Wed, 23.08.06
Adaptive colouring of upgrowing posets
Wed, 19.07.06
Dominating pairs in AT-free graphs
Wed, 05.07.06
Counting Bipolar Orientations on the Grid
Wed, 28.06.06
Convex-Pseudo Decompositions
Tue, 20.06.06
3-Loop Networks with many Minimum Distance Diagrams
Wed, 14.06.06
Enumeration of Bipolar Orientations
Wed, 07.06.06
The Gupta-Newman-Rabinovich-Sinclair Conjecture
Wed, 31.05.06
Integer Realizations of 3-Polytopes
Wed, 24.05.06
Proofs of Untileability
Wed, 17.05.06
Cocomparability graphs of posets with (interval) dimension at most two
Wed, 10.05.06
Online Chain Partitioning of Upgrowing Interval Posets - The Upper Bound
Wed, 03.05.06
Semi Bar 1-Visibility Graphs
Wed, 26.04.06
The Normal Graph Conjecture for line graphs
Wed, 19.04.06
Bipolar Orientations
Wed, 05.04.06
Circulant Graphs and Binomial Ideals
Wed, 15.03.06
On the Number of 3-Orientations of a Triangulation
Wed, 08.03.06
A binary labeling for the angles of a plane quadrangulation
Wed, 01.03.06
Reachability substitutes
Wed, 22.02.06
Two Algorithms for Bipartite Cardinality Matching
Wed, 08.02.06
Bar 1-Visibility Graphs - Introduction and First Results
Wed, 01.02.06
Counting Linear Extensions
Wed, 25.01.06
Skelette 3-dimensionaler Ordnungen
Wed, 18.01.06
A Representation of the Subset 'VPT' of Chordal Graphs as Intersection Graphs of Pseudosegments
Wed, 11.01.06
The Upper Bound for Online Chain Covering of Upgrowing Interval Posets
Wed, 14.12.05
Schnyder Woods and Pairs of Non-Crossing Dyck Paths
Wed, 07.12.05
Box Graphs and Graph Dimension
Wed, 23.11.05
Realizers for d-polytopes with d+2 vertices
Wed, 23.11.05
On the Braid Page of Gauss' Handbook 7
Wed, 16.11.05
Relations within the class of intersection graphs
Wed, 09.11.05
A special case of online chain covering of posets
Wed, 02.11.05
Dualization in Products of Chains
Wed, 26.10.05
Visibility Graphs on Point Sets
Wed, 05.10.05
What makes the treewidth large?
Wed, 21.09.05
Enumeration of Reduced Words in Combinatorial Group Theory
Wed, 14.09.05
Lies and Hypercubes
Wed, 31.08.05
A Schnyder Wood with no rigid AND coplanar embedding
Wed, 24.08.05
Orthogonal Surfaces - A combinatorial definition for characteristic points
Wed, 17.08.05
Enumeration of d-polytopes with d+3 vertices
Wed, 10.08.05
Poset Polytopes and Linear Extensions
Wed, 13.07.05
Intersection Graphs
Wed, 06.07.05
An upper bound for online chain covering
Wed, 29.06.05
Closure and Hamiltonian Properties in Claw-free Graphs
Wed, 22.06.05
Partial Orders - fooling Alice
Wed, 15.06.05
What is an orthogonal complex?
Wed, 08.06.05
A Combinatorial Property of Databases
Wed, 25.05.05
Claws and Paws