default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 88
Volume 88, Number 1, February 2026
- Michaela Borzechowski, Patrick Schnider, Simon Weber:
An FPT Algorithm for Splitting a Necklace Among Two Thieves. 1 - Bogdan Alecu
, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. 2 - Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete. 3 - Therese Biedl, Karthik Murali:
On computing vertex connectivity of 1-planar graphs. 4 - Martin S. Krejca, Carsten Witt:
A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive. 5 - Haitao Wang, Yiming Zhao:
Computing the Minimum Bottleneck Moving Spanning Tree. 6 - Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. 7 - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. 8 - Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. 9 - Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. 10 - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. 11 - Andreas Emil Feldmann, Tung Anh Vu:
Generalized k-Center: Distinguishing Doubling and Highway Dimension. 12 - Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. 13 - Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. 14 - Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. 15 - Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set when Excluding an Induced Minor: K1 + tK2 and $tC_3 \uplus C_4$. 16 - Johannes Lengler, Leon Schiller, Oliver Sieberling:
Plus Strategies are Exponentially Slower for Planted Optima of Random Height. 17 - Florent Becker, Daniel Hader, Matthew J. Patitz:
Strict Self-Assembly of Discrete Self-Similar Fractals in the Abstract Tile Assembly Model. 18 - Antonio Blanca, Xusheng Zhang:
Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case. 19
Volume 88, Number 2, April 2026
- Alexander Dobler, Martin Nöllenburg:
Block Crossings in One-Sided Tanglegrams. 20 - Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva:
Concentration of Submodular Functions and Read-k Families Under Negative Dependence. 21 - Gabriel Ponte, Marcia Fampa, Jon Lee:
Convex relaxation for the generalized maximum-entropy sampling problem. 22 - Vijay V. Vazirani:
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. 23 - Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel:
Graph Exploration: The Impact of a Distance Constraint. 24 - Daniel Hathcock, Guy Kortsarz, R. Ravi:
The Telephone k-Multicast Problem. 25 - Théo Boury, Laurent Bulteau, Bertrand Marchand, Yann Ponty:
Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms. 26 - Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland:
The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination. 27 - Dominique Attali, André Lieutier:
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by ℓ 1-Norm Minimization. 28 - Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable. 29 - Telikepalli Kavitha:
Max-Utility Matchings with Popularity via Critical Vertices. 30 - Ildikó Schlotter:
Shortest Two Disjoint Paths in Conservative Graphs. 31 - Duc-Cuong Dang, Per Kristian Lehre:
The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. 32 - Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray:
Sweeping Arrangements of Non-Piercing Regions in the Plane. 33 - Zachary Friggstad, Mahya Jamshidian:
Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii. 34 - Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. 35
Volume 88, Number 3, June 2026
- Tamal K. Dey, Tao Hou, Dmitriy Morozov:
A Fast Algorithm for Computing Zigzag Representatives. 36 - Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. 37 - Elena Grigorescu, Nithish Kumar, Young-San Lin:
Approximation Algorithms for Directed Weighted Spanners. 38 - Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. 39 - Ofek Gila, Michael T. Goodrich, Robert E. Tarjan:
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. 40 - Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. 41 - Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences. 42 - Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh:
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. 43 - Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek:
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. 44 - Haris Aziz, Péter Biró, Gergely Csáji, Ali Pourmiri:
Ex-post Stability under Two-Sided Matching: Complexity and Characterization. 45 - Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. 46 - Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing Pivot-Minors. 47 - Amir Abboud, Nick Fischer, Yarin Shechter:
Faster Combinatorial k-Clique Algorithms. 48 - Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings. 49 - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon Rumle Tarnow:
Compressed Dictionary Matching on Run-Length Encoded Strings. 50 - Gill Barequet, Gil Ben-Shachar:
Counting Polyominoes, Revisited. 51 - Tijn de Vos, Aleksander Bjørn Grodt Christiansen:
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. 52 - Alistair Benford, Per Kristian Lehre:
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. 53
Volume 88, Number 4, August 2026
- Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley:
A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. 54 - Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments. 55 - Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. 56 - Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong:
Reforming an Unfair Allocation by Exchanging Goods. 57 - Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung:
MUL-Tree Pruning for Consistency and Compatibility. 58
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 2026-08-12 22:59 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
