Demo Data from VLDB 2026 / reviewers in the wild / expert
Thomas McConville
dblp:195/2677
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-5334-6249ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Computational geometry · 50% Graph algorithms and graph theory · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › graph theory
hamiltonian path |
1.0 | 1 | 2026 | Traversing regions of supersolvable hyperplane arrangements and their lattice quotients · SODA 2026 |
Computational geometry › arrangement
hyperplane arrangement |
1.0 | 1 | 2026 | Traversing regions of supersolvable hyperplane arrangements and their lattice quotients · SODA 2026 |
Methods — techniques the papers use, named apart from their topics
poset of regions · 1.0lattice congruence · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Traversing regions of supersolvable hyperplane arrangements and their lattice quotientsabstractFor an arrangement \(\mathcal{H}\) of hyperplanes in \(\mathbb{R}^n\) through the origin, a region is a connected subset of \(\mathbb{R}^n \setminus \mathcal{H}\). The graph of regions \(G(\mathcal{H})\) has a vertex for every region, and an edge between any two vertices whose corresponding regions are separated by a single hyperplane from \(\mathcal{H}\). We aim to compute a Hamiltonian path or cycle in the graph \(G(\mathcal{H})\), i.e., a path or cycle that visits every vertex (=region) exactly once. Our first main result is that if \(\mathcal{H}\) is a supersolvable arrangement, then the graph of regions \(G(\mathcal{H})\) has a Hamiltonian cycle. More generally, we consider quotients of lattice congruences of the poset of regions \(\mathsf{P}(\mathcal{H}, R_0)\), obtained by orienting the graph \(G(\mathcal{H})\) away from a particular base region \(R_0\). Our second main result is that if \(\mathcal{H}\) is supersolvable and \(R_0\) is a canonical base region, then for any lattice congruence \(\equiv\) on \(\mathsf{P}(\mathcal{H}, R_0) =: L\), the cover graph of the quotient lattice \(L/{\equiv}\) has a Hamiltonian path. Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze |
SODA | 3 |
| 2022 | The Facial Weak Order on Hyperplane ArrangementsabstractWe extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent definitions of the facial weak order of a central arrangement: (1) by exploiting the fact that the faces are intervals in the poset of regions, (2) by describing its cover relations, (3) using covectors of the corresponding oriented matroid, and (4) using certain sets of normal vectors closely related to the geometry of the corresponding zonotope. Using these equivalent descriptions, we show that when the poset of regions is a lattice, the facial weak order is a lattice. In the case of simplicial arrangements, we further show that this lattice is semidistributive and give a description of its join-irreducible elements. Finally, we determine the homotopy type of all intervals in the facial weak order. Aram Dermenjian, Christophe Hohlweg, Thomas McConville, Vincent Pilaud |
Discret. Comput. Geom. | 3 |