default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 87
Volume 87, Number 1, January 2025
- Yansong Gao, Jie Zhang
:
On Scheduling Mechanisms Beyond the Worst Case. 1-21 - Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). 22-88 - Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. 89-131 - Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. 132-147 - Huong Luu, Marek Chrobak:
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. 148-165
Volume 87, Number 2, February 2025
- Susanne Albers, Sebastian Schubert:
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. 167-190 - Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau:
Partition Strategies for the Maker-Breaker Domination Game. 191-222 - Pankaj K. Agarwal, Esther Ezra:
Line Intersection Searching Amid Unit Balls in 3-Space. 223-241 - Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad, Helia Yazdanyar:
Galloping in Fast-Growth Natural Merge Sorts. 242-291 - Telikepalli Kavitha:
Popular Roommates in Simply Exponential Time. 292-320
Volume 87, Number 3, March 2025
- Jurek Czyzowicz, Leszek Gasieniec, Ryan Killick, Evangelos Kranakis:
Symmetry Breaking in the Plane. 321-343 - Thomas Bläsius, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. 344-376 - Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Shared Versus Private Randomness in Distributed Interactive Proofs. 377-404 - Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. 405-428 - Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs I: The Framework. 429-464
Volume 87, Number 4, April 2025
- Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima:
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. 465-506 - Frank Neumann, Dirk Sudholt, Carsten Witt:
The Compact Genetic Algorithm Struggles on Cliff Functions. 507-536 - Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif:
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. 537-571 - Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Guarding Polyominoes Under k-Hop Visibility. 572-593 - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. 594-620
Volume 87, Number 5, May 2025
- Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. 621-660 - Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan:
Analysis of the (1+1) EA on LeadingOnes with Constraints. 661-689 - Eric Rivals, Michelle Sweering, Pengfei Wang:
Convergence of the Number of Period sets in Strings. 690-711 - Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney:
Enumerating Minimal Solution Sets for Metric Graph Problems. 712-735 - Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. 736-782 - Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. 783-811 - Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad, Helia Yazdanyar:
Correction: Galloping in Fast-Growth Natural Merge Sorts. 812
Volume 87, Number 6, June 2025
- Nicole Megow, Lukas Nölke:
Online Metric Matching on the Line with Recourse. 813-841 - Yongjie Yang:
On the Parameterized Complexity of Controlling Amendment and Successive Winners. 842-907 - Haitao Wang, Yiming Zhao:
Improved Algorithms for Distance Selection and Related Problems. 908-929 - Carlos Alegría-Galicia, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Upward Pointset Embeddings of Planar st-Graphs. 930-960 - Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos:
Structural Parameterization of Cluster Deletion. 961-981
Volume 87, Number 7, July 2025
- Jonas Lill, Kalina Petrova, Simon Weber:
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. 983-1007 - Bodo Manthey, Jesse van Rhijn:
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. 1008-1039 - Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz:
Reconfiguration of the Union of Arborescences. 1040-1059 - André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. 1060-1080 - Per Kristian Lehre, Andrew M. Sutton:
Runtime Analysis with Variable Cost. 1081-1110
Volume 87, Number 8, August 2025
- Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. 1111-1144 - Editor's Note: Special Issue on GECCO 2023. 1145
- Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. 1146-1177 - Ragesh Jaiswal, Amit Kumar:
Clustering What Matters in Constrained Settings. 1178-1198 - Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. 1199-1221
Volume 87, Number 9, September 2025
- Cléophée Robin, Eileen Robinson:
Coloring Bridge-Free Antiprismatic Graphs. 1223-1246 - Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa:
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. 1247-1273 - Mario Alejandro Hevia Fajardo, Per Kristian Lehre:
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems. 1274-1310 - Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. 1311-1339 - Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Fair Repetitive Interval Scheduling. 1340-1368
Volume 87, Number 10, October 2025
- Seungbum Jo, Geunho Kim:
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. 1369-1392 - Ioannis Mantas, Evanthia Papadopoulou, Rodrigo I. Silveira, Zeyu Wang:
The Farthest Color Voronoi Diagram in the Plane. 1393-1419 - Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. 1420-1452 - Baruch Schieber, Bhargav Samineni, Soroush Vahidi:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. 1453-1473 - Yongjie Yang:
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners. 1474-1475
Volume 87, Number 11, November 2025
- Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Boosting Double Coverage for k-Server via Imperfect Predictions. 1477-1517 - Marvin Künnemann, Bodo Manthey, Rianne Veenstra:
Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise. 1518-1563 - Andre Opris, Johannes Lengler, Dirk Sudholt:
Achieving Tight O(4k) Runtime Bounds on Jumpk by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity. 1564-1619 - Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. 1620-1668 - Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. 1669-1709
Volume 87, Number 12, December 2025
- Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. 1711-1731 - Minglong Qin, Penghui Yao:
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. 1732-1803 - Joost Jorritsma, Johannes Lengler, Dirk Sudholt:
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. 1804-1863 - N. R. Aravind, Roopam Saxena:
Parameterized Complexity of Path Set Packing. 1864-1898 - Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log-Diameter MST Verification and Sensitivity in MPC. 1899-1932 - Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. 1933-1996 - Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$. 1997-2017
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
