Stop the war!Остановите войну!
for scientists:
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
a service of 
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-04-26 18:25 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
