default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 86
Volume 86, Number 1, January 2024
- Henry Bambury, Antoine Bultel, Benjamin Doerr
:
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. 1-32 - Youhei Akimoto:
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms. 33-63 - Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. 64-89 - Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Runtime Analysis for Permutation-based Evolutionary Algorithms. 90-129 - Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou:
A Semi Brute-Force Search Approach for (Balanced) Clustering. 130-146 - Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. 147-170 - T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. 171-193 - Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi:
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. 194-217 - Andrew Alseth, Matthew J. Patitz:
The Need for Seed (in the Abstract Tile Assembly Model). 218-280 - Charis Papadopoulos, Athanasios E. Zisis:
Computing and Listing Avoidable Vertices and Paths. 281-306 - Arnab Maiti, Palash Dey:
On Parameterized Complexity of Binary Networked Public Goods Game. 307-333 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. 334-366
Volume 86, Number 2, February 2024
- Benjamin Doerr, Timo Kötzing:
Lower Bounds from Fitness Levels Made Easy. 367-395 - Per Kristian Lehre, Xiaoyu Qin:
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments. 396-441 - Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. 442-484 - Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao:
Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation. 485-504 - Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. 505-525 - Mario Alejandro Hevia Fajardo, Dirk Sudholt:
Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter. 526-565 - Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. 566-584 - Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. 585-612 - Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. 613-637 - Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. 638-655 - Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. 656-693
Volume 86, Number 3, March 2024
- Cristina Bazgan, Henning Fernau:
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. 695-696 - Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. 697-716 - Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. 717-734 - Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. 735-756 - Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. 757-781 - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. 782-807 - Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. 808-824 - Felicia Lucke, Felix Mann:
Reducing Graph Parameters by Contractions and Deletions. 825-851 - Takuya Mieno, Mitsuru Funakoshi:
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. 852-873 - Charis Papadopoulos, Spyridon Tzimas:
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. 874-906
Volume 86, Number 4, April 2024
- Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. 907-943 - Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. 944-1005 - Ishay Haviv:
On Finding Constrained Independent Sets in Cycles. 1006-1030 - Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares:
Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. 1031-1056 - Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. 1057-1079 - Benjamin Qi:
On Maximizing Sums of Non-monotone Submodular and Linear Functions. 1080-1134 - Liting Huang, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. 1135-1162 - Joanna Raczek:
Complexity Issues on of Secondary Domination Number. 1163-1172 - Moran Feldman, Ariel Szarf:
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. 1173-1209 - Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Server Cloud Scheduling. 1210-1245 - Liad Blumrosen, Shahar Dobzinski:
Combinatorial Reallocation Mechanisms. 1246-1262 - Miriam Münch, Ignaz Rutter, Peter Stumpf:
Partial and Simultaneous Transitive Orientations via Modular Decompositions. 1263-1292
Volume 86, Number 5, May 2024
- Mingyu Xiao, Sen Huang, Xiaoyu Chen:
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs. 1293-1334 - Yuefang Lian, Donglei Du, Xiao Wang, Dachuan Xu, Yang Zhou:
Stochastic Variance Reduction for DR-Submodular Maximization. 1335-1364 - Julien Courtiel, Paul Dorbec, Romain Lecoq:
Theoretical Analysis of Git Bisect. 1365-1399 - Mingyang Gong, Zhi-Zhong Chen, Kuniteru Hayashi:
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. 1400-1427 - Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. 1428-1474 - Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Harmless Set Problem. 1475-1511 - Sergio Cabello, David Gajser:
Connectivity with Uncertainty Regions Given as Line Segments. 1512-1544 - Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Approximations for Throughput Maximization. 1545-1577 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. 1578-1599 - Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. 1600-1622 - Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. 1623-1656 - Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. 1657-1699 - Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite State Machines. 1700-1729
Volume 86, Number 6, June 2024
- Naoto Ohsaka:
On the Parameterized Intractability of Determinant Maximization. 1731-1763 - Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray:
Sublinear Time Eigenvalue Approximation via Random Sampling. 1764-1829 - Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. 1830-1861 - Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. 1862-1887 - Telikepalli Kavitha:
Stable Matchings, One-Sided Ties, and Approximate Popularity. 1888-1920 - Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions with Neighborly Help. 1921-1947 - Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching: Theory and Practice. 1948-1978 - Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-Time. 1979-2025 - Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. 2026-2040 - Asaf Levin:
The Near Exact Bin Covering Problem. 2041-2066 - Editor's Note: Special Issue with GECCO 2021. 2067
Volume 86, Number 7, July 2024
- Johannes Lengler, Andre Opris, Dirk Sudholt:
Analysing Equilibrium States for Population Diversity. 1-35 - Augusto Modanese, Thomas Worsch:
Embedding Arbitrary Boolean Circuits into Fungal Automata. 2069-2091 - Feodor F. Dragan, Guillaume Ducoffe:
α i-Metric Graphs: Radius, Diameter and all Eccentricities. 2092-2129 - Prasad Chaugule, Nutan Limaye:
On The Closures of Monotone Algebraic Classes and Variants of the Determinant. 2130-2151 - Guido Brückner, Ignaz Rutter, Peter Stumpf:
Extending Partial Representations of Circle Graphs in Near-Linear Time. 2152-2173 - Vít Jelínek, Michal Opler, Pavel Valtr:
Generalized Coloring of Permutations. 2174-2210 - Daniel Hader, Matthew J. Patitz:
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly. 2211-2249 - Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. 2250-2288 - Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. 2289-2316 - Per Kristian Lehre:
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function. 2352-2392 - Magnús M. Halldórsson, Dror Rawitz:
Online Multiset Submodular Cover. 2393-2411
Volume 86, Number 8, August 2024
- Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. 2413-2447 - Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. 2448-2478 - Benjamin Doerr, Andrew James Kelley:
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. 2479-2518 - Omer Cohen Sidon, Dana Ron:
Sample-Based Distance-Approximation for Subsequence-Freeness. 2519-2556 - Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. 2557-2574 - Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur:
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. 2575-2604 - Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. 2605-2624 - Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation Algorithms for Covering Vertices by Long Paths. 2625-2651 - Davide Bilò:
New Algorithms for Steiner Tree Reoptimization. 2652-2675 - Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. 2676-2713 - Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. 2714-2738
Volume 86, Number 9, September 2024
- Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh:
Online Geometric Covering and Piercing. 2739-2765 - Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. 2766-2785 - Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Predictions. 2786-2821 - David G. Harris:
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. 2822-2844 - Bengt J. Nilsson, Eli Packer:
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. 2845-2884 - Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. 2885-2928 - Amirhossein Rajabi, Carsten Witt:
Stagnation Detection in Highly Multimodal Fitness Landscapes. 2929-2958 - Irvan Jahja, Haifeng Yu:
Sublinear Algorithms in T-Interval Dynamic Networks. 2959-2996 - Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. 2997-3026 - David Eppstein:
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. 3027-3053 - József Balogh, Felix Christian Clemen, Adrian Dumitrescu:
On a Traveling Salesman Problem for Points in the Unit Cube. 3054-3078
Volume 86, Number 10, October 2024
- Yiqin Gao, Li Han, Jing Liu, Yves Robert, Frédéric Vivien:
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints. 3079-3114 - Carola Doerr, Duri Andrea Janett, Johannes Lengler:
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. 3115-3152 - William M. Hoza, Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. 3153-3185 - Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. 3186-3230 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. 3231-3251 - Jakob Bossek, Dirk Sudholt:
Runtime Analysis of Quality Diversity Algorithms. 3252-3283 - Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. 3284-3308 - Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. 3309-3338
Volume 86, Number 11, November 2024
- Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer:
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators. 3339-3394 - Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. 3395-3424 - Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. 3425-3464 - Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest Like Regions. 3465-3495 - Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache:
Testing Connectedness of Images. 3496-3517 - Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs. 3518-3578 - Ameet Gadekar:
On the Parameterized Complexity of Compact Set Packing. 3579-3597 - Chien-Chung Huang, François Sellier:
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints. 3598-3628
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 2024-11-21 20:18 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:
