Improved bounds for the expected number of k-sets
Online Coloring of Chordal Graphs
A promise preserving reduction from the General P-Matrix Linear Complementarity Problem (P-GLCP) to Unique Sink Orientations of Grids (Grid-USO)
Algorithms and complexity of elementary functions
Subcubic planar graphs of girth 7 are class I
Cops and Robbers [Part VI] ... or VII?
Two geometric impossibility theorems.
Shortest Path in Unit Disk Graphs
Das symmetrische Rendezvous-Dilemma (in German)
Evaluation of the Burrows-Wheeler Transformation in the context of the BZIP2 algorithm.
Convex hull peeling, and the affine curvature-shortening flow
Small grid embeddings of planar graphs with a varying number of cycles
Simplifying non-simple fan-planar drawings
Highway Dimension and Contraction Hierarchies
Point sets maximizing the number of perfect cross-matchings
Zero-sum cycles modulo q in complete digraphs
Colorings of oriented planar graphs avoiding a monochromatic subgraph
Finding subgraph isomorphisms using color-coding.
Grid peeling and the Affine Curvature-Shortending Flow (in English)
Drawings of K_n with the same rotation scheme are the same up to triangle-flips (Gioan’s Theorem)
Lower bounds for the number of pseudoline arrangements. Transcript, recording 42 min, password Atleast0.2083n^2
Advice Complexity of Online Non-Crossing Matching. Recording 53 min, password Catalan1
Scientific Writing. Recording 42 min, Password phantasy333Novel
Synchronizing sequences in rectilinear polygons
The complexity of the Hausdorff distance. Recording 31 min, password: ETR-hard1
Edge Partitions of Complete Geometric Graphs (Part 1) II. Recording 37 min, Password n-1Matchings
Name-Independent Routing. Recording 38 min, password: IPv6-names
Fixed-point cycles. Recording 31 min, password: d^2-for-Functions
Single-source shortest path in disk graphs. Recording 39 min, password O(nLog2n)
Epsilon-approximations and the halving method. Recording 46 min, password Eps^(-2d.d+1)
Concurrent disjoint set union. Recording 48 min, password Jayanti-Tarjan-2021
Unfolding orthogonal polyhedra. Recording 41 min, password z-Range5-6
Adjacency labeling for graphs. Recording 36 min, password kBits-are-2^kValues
Cyclic ordering. Recording 37 min, password: Transitive1234
Probabilistic Finite Automaton Emptiness is undecidable, or: Who is afraid of small probabilities? Recording ...
Nearest-Neighbor Decompositions of Drawings
Improved bounds for the expected number of k-sets (part 2)
Advice Complexity of Online Non-Crossing Matching (Part II).
rehearsal of talks at EuroCG 2022
Convex hull peeling, and the affine curvature-shortening flow, part 2
EOPL = PPAD ∩ PLS
Convergence characteristics of the ICP algorithm
Online sorting and online TSP.
The Effects of Initialization on the Convergence of Non-negative Matrix Factorization