default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 75
Volume 75, Number 1, May 2016
- Sebastian Ordyniak
, Alexandru Popa:
A Parameterized Study of Maximum Generalized Pattern Matching Problems. 1-26 - Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang:
Matroid and Knapsack Center Problems. 27-52 - Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. 53-83 - Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. 84-117 - Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. 118-137 - Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano:
Computing Directed Pathwidth in O(1.89n) Time. 138-157 - Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
Two-Page Book Embeddings of 4-Planar Graphs. 158-185 - Dieter Kratsch, Ioan Todinca:
Guest Editorial: Selected Papers from WG 2014. 186 - Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. 187-204 - Eglantine Camby, Oliver Schaudt:
A New Characterization of Pk-Free Graphs. 205-217 - Sigve Hortemo Sæther, Jan Arne Telle:
Between Treewidth and Clique-Width. 218-253
Volume 75, Number 2, June 2016
- Marek Cygan, Pinar Heggernes:
Foreword: Special Issue on IPEC 2014. 255-256 - Marek Cygan, Pinar Heggernes:
Erratum to: Foreword: Special Issue on IPEC 2014. 257 - Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. 258-276 - Igor Razgon:
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. 277-294 - Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. 295-321 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Solving Linear Equations Parameterized by Hamming Weight. 322-338 - Patrick Traxler:
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments. 339-362 - Jannis Bulian, Anuj Dawar:
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. 363-382 - Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. 383-402 - Holger Dell:
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations. 403-423
Volume 75, Number 3, July 2016
- Benjamin Doerr, Carsten Witt:
Guest Editorial: Theory of Evolutionary Computation. 425-427 - Duc-Cuong Dang, Per Kristian Lehre:
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information. 428-461 - Christian Gießen, Timo Kötzing:
Robustness of Populations in Stochastic Environments. 462-489 - Timo Kötzing:
Concentration of First Hitting Times Under Additive Drift. 490-506 - Andrew M. Sutton:
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. 507-528 - Benjamin Doerr, Carola Doerr:
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics. 529-553 - Andrei Lissovoi, Carsten Witt:
MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions. 554-576
Volume 75, Number 4, August 2016
- Mireille Bousquet-Mélou, Robert Sedgewick, Michèle Soria:
Introduction for S.I. AofA14. 577-578 - Michael Drmota, Emma Yu Jin:
An Asymptotic Analysis of Labeled and Unlabeled k-Trees. 579-605 - Daniel Krenn, Stephan G. Wagner:
Compositions into Powers of b: Asymptotic Enumeration and Parameters. 606-631 - Markus E. Nebel, Sebastian Wild, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. 632-683 - Amalia Duch, Gustavo Lau, Conrado Martínez:
On the Cost of Fixed Partial Match Queries in K-d Trees. 684-723 - Svante Janson, Alfredo Viola:
A Unified Approach to Linear Probing Hashing with Buckets. 724-781 - Stephen Melczer, Marni Mishna:
Asymptotic Lattice Path Enumeration Using Diagonals. 782-811 - Axel Bacher, Andrea Sportiello:
Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution. 812-831
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-12 01:24 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:
