このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
2022 · SoCG
A Positive Fraction Erdős-Szekeres Theorem and Its ApplicationsAndrew Suk, Ji Zeng
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
A Solution to Ringel’s Circle ProblemJames Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
A Universal Triangulation for Flat ToriFrancis Lazarus, Florent Tallerie
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Acute Tours in the PlaneAhmad Biniaz
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
An (ℵ₀,k+2)-Theorem for k-TransversalsChaya Keller, Micha A. Perles
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Approximation Algorithms for Maximum Matchings in Geometric Intersection GraphsSariel Har-Peled, Everett Yang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Asymptotic Bounds on the Combinatorial Diameter of Random PolytopesGilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Chains, Koch Chains, and Point Sets with Many TriangulationsDaniel Rutschmann, Manuel Wettstein
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Computing Continuous Dynamic Time Warping of Time Series in Polynomial TimeKevin Buchin, André Nusser, Sampson Wong
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its ApplicationsTamal K. Dey, Woojin Kim, Facundo Mémoli
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Computing a Link Diagram from Its ExteriorNathan M. Dunfield, Malik Obeidin, Cameron Gates Rudd
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Covering Points by Hyperplanes and Related ProblemsZuzana Patáková, Micha Sharir
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm MinimizationDominique Attali, André Lieutier
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Disjointness Graphs of Short Polygonal ChainsJános Pach, Gábor Tardos, Géza Tóth
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Dynamic Connectivity in Disk GraphsHaim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling CurvesKarl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, Dániel Marx, André Nusser
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded TreewidthMitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Edge Partitions of Complete Geometric GraphsOswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Erdős-Szekeres-Type Problems in the Real Projective PlaneMartin Balko, Manfred Scheucher, Pavel Valtr
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Farthest-Point Voronoi Diagrams in the Presence of Rectangular ObstaclesMincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Finding Weakly Simple Closed Quasigeodesics on Polyhedral SpheresJean Chartier, Arnaud de Mesmay
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat AnglesLily Chung, Erik D. Demaine, Dylan Hendrickson, Victor Luo
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
From Geometry to Topology: Inverse Theorems for Distributed PersistenceElchanan Solomon, Alexander Wagner, Paul Bendich
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
GPU Computation of the Euler Characteristic Curve for Imaging DataFan Wang, Hubert Wagner, Chao Chen
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips FiltrationsUlrich Bauer, Fabian Roll
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Hardness and Approximation of Minimum Convex PartitionNicolas Grelier
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Hop-Spanners for Geometric Intersection GraphsJonathan B. Conroy, Csaba D. Tóth
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related ProblemsPankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Long Plane TreesSergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree DualsTim Ophelders, Salman Parsa
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Minimum-Error Triangulations for Sea Surface ReconstructionAnna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Nearly-Doubling Spaces of Persistence DiagramsDonald R. Sheehy, Siddharth S. Sheth
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
On Comparable Box DimensionZdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology ClassErin Wolf Chambers, Salman Parsa, Hannah Schreiber
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling ProblemPeyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
On Semialgebraic Range ReportingPeyman Afshani, Pingan Cheng
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
On the Discrete Fréchet Distance in a GraphAnne Driemel, Ivor van der Hoog, Eva Rotenberg
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Optimal Coreset for Gaussian Kernel Density EstimationWai Ming Tai
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical MeasuresYair Bartal, Ora Nova Fandina, Kasper Green Larsen
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Parameterised Partially-Predrawn Crossing NumberThekla Hamm, Petr Hliněný
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Parameterized Algorithms for Upward PlanaritySteven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Persistent Cup-LengthMarco Contessoto, Facundo Mémoli, Anastasios Stefanou, Ling Zhou
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Point Separation and Obstacle Removal by Finding and Hitting Odd CyclesNeeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Quasi-Universality of Reeb Graph DistancesUlrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Robust Radical Sylvester-Gallai Theorem for QuadraticsAbhibhav Garg, Rafael Oliveira, Akash Kumar Sengupta
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Robust Sylvester-Gallai Type Theorem for Quadratic PolynomialsShir Peleg, Amir Shpilka
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Short Topological Decompositions of Non-Orientable SurfacesNiloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Signed Barcodes for Multi-Parameter Persistence via Rank DecompositionsMagnus Bakke Botnan, Steffen Oppermann, Steve Oudot
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower BoundHung Le, Lazar Milenković, Shay Solomon
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Swap, Shift and Trim to Edge Collapse a FiltrationMarc Glisse, Siddharth Pritam
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
The Complexity of the Hausdorff DistancePaul Jungeblut, Linda Kleist, Tillmann Miltzow
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
The Degree-Rips Complexes of an Annulus with OutliersAlexander Rolle
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
The Universal 𝓁^p-Metric on Merge TreesRobert Cardona, Justin Curry, Tung Lam, Michael Lesnick
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Three-Chromatic Geometric HypergraphsGábor Damásdi, Dömötör Pálvölgyi
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Tight Lower Bounds for Approximate & Exact k-Center in ℝ^dRajesh Chitnis, Nitin Saurabh
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Tighter Bounds for Reconstruction from ε-SamplesHåvard Bakke Bjerkevik
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Tiling with Squares and Packing Dominos in Polynomial TimeAnders Aamand, Mikkel Abrahamsen, Thomas Ahle, Peter M. R. Rasmussen
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Towards Sub-Quadratic Diameter Computation in Geometric Intersection GraphsKarl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Tracking Dynamical Features via Continuation and PersistenceTamal K. Dey, Michał Lipiński, Marian Mrozek, Ryan Slechta
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk GraphsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Twisted Ways to Find Plane Structures in Simple Drawings of Complete GraphsOswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
Unlabeled Multi-Robot Motion Planning with Tighter Separation BoundsBahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
Algorithms & Complexity
日本大学: 電気通信大学
2022 · SoCG
Weak Coloring Numbers of Intersection GraphsZdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2022 · SoCG
ε-Isometric Dimension Reduction for Incompressible Subsets of 𝓁_pAlexandros Eskenazis
Algorithms & Complexity
日本大学: 関与なし(対象大学)