Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAlgorithmica, Volume 68
Volume 68, Number 1, January 2014
- Arash Farzan, J. Ian Munro:
A Uniform Paradigm to Succinctly Encode Various Families of Trees. 16-40 - Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. 41-61 - Tomás Ebenlendr, Marek Krcál, Jirí Sgall:
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. 62-80 - Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. 109-132 - Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Evolutionary Algorithms for Quantum Computers. 152-189 - Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. 190-264
Volume 68, Number 2, February 2014
- Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. 287-311 - Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. 337-357 - George Karakostas, Euripides Markou:
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes. 358-389 - Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. 390-403 - Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. 504-530 - Xin He, Huaming Zhang:
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs. 531-544
Volume 68, Number 3, March 2014
- Eric McDermid, Robert W. Irving:
Sex-Equal Stable Matchings: Complexity and Exact Algorithms. 545-570 - Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. 626-642 - Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. 643-670 - Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. 671-691 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Scheduling Partially Ordered Jobs Faster than 2 n. 692-714 - Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. 715-738 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. 739-757 - Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. 758-775 - Jochen Könemann, Ojas Parekh, David Pritchard:
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. 776-804
Volume 68, Number 4, April 2014
- Michael T. Goodrich:
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons. 835-858 - Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. 859-885 - Steven Kelk, Céline Scornavacca:
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable. 886-915 - David G. Harris, Francis Sullivan, Isabel Beichl:
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. 916-939 - Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. 940-953 - Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. 954-997 - Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P 7-Free Graphs in Linear Time. 998-1018 - Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. 1045-1074 - Luca Foschini, John Hershberger, Subhash Suri:
On the Complexity of Time-Dependent Shortest Paths. 1075-1097
maintained by 
, founded at 
, founded at 
last updated on 2019-02-17 19:30 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
