このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
2025 · SoCG
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under TranslationTimothy M. Chan, Isaac M. Hair
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Minor-Testing Approach for Coordinated Motion Planning with Sliding RobotsEduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Note on the No-(d+2)-On-a-Sphere ProblemAndrew Suk, Ethan Patrick White
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A PTAS for TSP with Neighbourhoods over Parallel Line SegmentsBenyamin Ghaseminia, Mohammad R. Salavatipour
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Practical Algorithm for Knot FactorisationAlexander He, Eric Sedgwick, Jonathan Spreer
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Sparse Multicover Bifiltration of Linear SizeÁngel Javier Alonso
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Subquadratic Algorithm for Computing the L₁-Distance Between Two TerrainsPankaj K. Agarwal, Boris Aronov, Olivier Devillers, Christian Knauer, Guillaume Moroz
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
A Theory of Sub-BarcodesOliver A. Chubet, Kirk P. Gardner, Donald R. Sheehy
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
An 11/6-Approximation Algorithm for Vertex Cover on String GraphsÉdouard Bonnet, Paweł Rzążewski
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti NumberColleen Delaney, Clément Maria, Eric Samperton
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Apex RepresentativesTamal K. Dey, Tao Hou, Dmitriy Morozov
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Approximating Klee’s Measure Problem and a Lower Bound for Union Volume EstimationKarl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Banana Trees for the Persistence in Time Series ExperimentallyLara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to PracticeLuca Castelli Aleardi, Eric Fusy, Jyh-Chwen Ko, Razvan-Stefan Puscasu
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent HomologyDmitriy Morozov, Luis Scoccola
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Computing Geomorphologically Salient Networks via Discrete Morse TheoryTim Ophelders, Anna Schenfisch, Willem Sonke, Bettina Speckmann
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Computing Oriented Spanners and Their DilationKevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Convexity Helps Iterated Search in 3DPeyman Afshani, Yakov Nekrich, Frank Staals
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Decomposing Multiparameter Persistence ModulesTamal K. Dey, Jan Jendrysiak, Michael Kerber
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Dynamic Maximum Depth of Geometric ObjectsSubhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Efficient Greedy Discrete Subtrajectory ClusteringIvor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Embedding Graphs as Euclidean kNN-GraphsThomas Schibler, Subhash Suri, Jie Xue
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Exact Algorithms for Minimum Dilation TriangulationSándor P. Fekete, Phillip Keldenich, Michael Perk
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Extremal Betti Numbers and Persistence in Flag ComplexesLies Beers, Magnus Bakke Botnan
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate TechniqueTimothy M. Chan, Zhengcheng Huang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Finding a Shortest Curve That Separates Few Objects from ManyTherese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Geometric Bipartite Matching Based Exact Algorithms for Server ProblemsSharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Geometric Realizations of Dichotomous Ordinal GraphsPatrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Geometric Spanners of Bounded Tree-WidthKevin Buchin, Carolin Rehs, Torben Scheele
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Hard Diagrams of Split LinksCorentin Lunel, Arnaud de Mesmay, Jonathan Spreer
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Higher Order Bipartiteness vs Bi-Partitioning in Simplicial ComplexesMarzieh Eidi, Sayan Mukherjee
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor FrameworkSang Won Bae, Nicolau Oliver, Evanthia Papadopoulou
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Immersions and Albertson’s ConjectureJacob Fox, János Pach, Andrew Suk
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Improved Approximation Algorithms for Three-Dimensional KnapsackKlaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, Malte Tutas
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Incremental Planar Nearest Neighbor Queries with Optimal Query TimeJohn Iacono, Yakov Nekrich
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing NumbersElizaveta Streltsova, Uli Wagner
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Lipschitz Decompositions of Finite 𝓁_{p} MetricsRobert Krauthgamer, Nir Petruschka
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Nearest Neighbor Searching in a Dynamic Simple PolygonSarita de Berg, Frank Staals
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Non-Euclidean Erdős-Anning TheoremsDavid Eppstein
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
On Approximability of 𝓁₂² Min-Sum ClusteringKarthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, Samson Zhou
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other ApplicationsArnold Filtser
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
On Spheres with k Points InsideHerbert Edelsbrunner, Alexey Garber, Morteza Saghafian
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
On Zarankiewicz’s Problem for Intersection Hypergraphs of Geometric ObjectsTimothy M. Chan, Chaya Keller, Shakhar Smorodinsky
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
On the Twin-Width of Smooth ManifoldsÉdouard Bonnet, Kristóf Huszár
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Optimal Motion Planning for Two Square Robots in a Rectilinear EnvironmentPankaj K. Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, Martijn Struijs
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Persistent (Co)Homology in Matrix Multiplication TimeDmitriy Morozov, Primoz Skraba
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Polychromatic Coloring of Tuples in HypergraphsAhmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Miloš Stojaković
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Polynomial-Time Algorithms for Contiguous Art Gallery and Related ProblemsAhmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da Wei Zheng
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set ConstructionShion Fukuzawa, Michael T. Goodrich, Sandy Irani
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Range Counting Oracles for Geometric ProblemsAnne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Rapid Mixing of the Flip Chain over Non-Crossing Spanning TreesKonrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Recognizing 2-Layer and Outer k-Planar GraphsYasuaki Kobayashi, Yuto Okada, Alexander Wolff
Algorithms & Complexity
日本大学: 北海道大学 / 名古屋大学
2025 · SoCG
Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple SettingsMikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Shelling and Sinking Graphs on the SphereJeff Erickson, Christian Howard
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Signotopes with Few Plus SignsHelena Bergold, Lukas Egeling, Hung P. Hoang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Simplification of Trajectory StreamsSiu-Wing Cheng, Haoqiang Huang, Le Jiang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Single-Source Shortest Path Problem in Weighted Disk GraphsShinwoo An, Eunjin Oh, Jie Xue
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Small Triangulations of 4-Manifolds and the 4-Manifold CensusRhuaidi Antonio Burke, Benjamin A. Burton, Jonathan Spreer
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Snap Rounding: A Cautionary TaleJohn Hershberger
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Sparse Bounded Hop-Spanners for Geometric Intersection GraphsSujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Sparsification of the Generalized Persistence Diagrams for Scalability Through Gradient DescentMathieu Carrière, Seunghyun Kim, Woojin Kim
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Steinhaus Filtration and Stable Paths in the MapperDustin L. Arendt, Matthew Broussard, Bala Krishnamoorthy, Nathaniel Saul, Amber Thrall
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection GraphsJames Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Structure and Independence in Hyperbolic Uniform Disk GraphsThomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Sublinear Data Structures for Nearest Neighbor in Ultra High DimensionsMartin G. Herold, Danupon Nanongkai, Joachim Spoerhase, Nithin Varma, Zihang Wu
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Super-Polynomial Growth of the Generalized Persistence DiagramDonghan Kim, Woojin Kim, Wonjun Lee
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
The Erdős-Szekeres Conjecture RevisitedJineon Baek, Martin Balko
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
The Fréchet Distance Unleashed: Approximating a Dog with a FrogSariel Har-Peled, Benjamin Raichel, Eliot W. Robson
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
The Maximum Clique Problem in a Disk Graph Made EasyJ. Mark Keil, Debajyoti Mondal
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
The Maximum Number of Digons Formed by Pairwise Intersecting PseudocirclesEyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
The Point-Boundary Art Gallery Problem Is ∃ℝ-HardJack Stade
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Tiling with Three Polygons Is UndecidableErik D. Demaine, Stefan Langerman
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Tracking the Persistence of Harmonic Chains: Barcode and StabilityTao Hou, Salman Parsa, Bei Wang
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1DLotte Blank, Jacobus Conradi, Anne Driemel, Benedikt Kolbe, André Nusser, Marena Richter
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
Uniform Bounds on Product Sylvester-Gallai ConfigurationsAbhibhav Garg, Rafael Oliveira, Akash Kumar Sengupta
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
When Alpha-Complexes Collapse onto Codimension-1 SubmanifoldsDominique Attali, Mattéo Clémot, Bianca B. Dornelas, André Lieutier
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance ViolationsMatthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
Algorithms & Complexity
日本大学: 関与なし(対象大学)
2025 · SoCG
k-Dimensional Transversals for Fat Convex SetsAttila Jung, Dömötör Pálvölgyi
Algorithms & Complexity
日本大学: 関与なし(対象大学)