Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 78
Volume 78, Number 1, May 2017
- Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz
, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-Hard. 1-46 - Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. 47-85 - Rudolf Scheifele:
Steiner Trees with Bounded RC-Delay. 86-109 - Rajesh Chitnis, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. 110-146 - Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. 147-165 - K. Subramani, Piotr Wojciechowski:
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. 166-208 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin:
Distribution-Sensitive Construction of the Greedy Spanner. 209-231 - Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. 232-254 - Uriel Feige, Moshe Tennenholtz:
Optimization with Uniform Size Queries. 255-273 - Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. 274-297 - Basile Couëtoux, Elie Nakache, Yann Vaxès:
The Maximum Labeled Path Problem. 298-318 - Meirav Zehavi:
Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs. 319-341 - Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. 342-377
Volume 78, Number 2, June 2017
- J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top-k Term-Proximity in Succinct Space. 379-393 - Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi:
An External-Memory Algorithm for String Graph Construction. 394-424 - Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof Mechanisms for Competitive Influence in Networks. 425-452 - Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications. 453-491 - Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. 492-520 - Jelena Marasevic, Clifford Stein, Gil Zussman:
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. 521-557 - Carola Doerr, Francisco Chicano:
Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. 558-560 - Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. 561-586 - Christian Gießen, Carsten Witt:
The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax. 587-609 - Carola Doerr, Johannes Lengler:
OneMax in Black-Box Models with Several Restrictions. 610-640 - Andrei Lissovoi, Carsten Witt:
A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. 641-659 - Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations Can Be Essential in Tracking Dynamic Optima. 660-680 - Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová:
Towards a Runtime Comparison of Natural and Artificial Evolution. 681-713 - Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges:
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. 714-740
Volume 78, Number 3, July 2017
- Hu Ding, Jinhui Xu:
FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems. 741-770 - S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. 771-787 - Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. 788-818 - Guy Even, Moti Medina:
Online Packet-Routing in Grids with Bounded Buffers. 819-868 - Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-Router Mechanism. 869-895 - Frantisek Galcík, Ján Katrenic, Gabriel Semanisin:
On Computing an Optimal Semi-matching. 896-913 - Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. 914-944 - Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. 945-967 - Konstantinos Panagiotou, Leo Speidel:
Asynchronous Rumor Spreading on Random Graphs. 968-989 - Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. 990-1019 - Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. 1020-1040 - Jiecao Chen, Qin Zhang:
Improved Algorithms for Distributed Entropy Monitoring. 1041-1066 - Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer:
Stable Matching with Network Externalities. 1067-1106
Volume 78, Number 4, August 2017
- Nikhil Bansal, Irene Finocchi:
Guest Editors' Foreword. 1107-1108 - Kyle Genova, David P. Williamson:
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem. 1109-1130 - Anna Großwendt, Heiko Röglin:
Improved Analysis of Complete-Linkage Clustering. 1131-1150 - Daniel Graf:
How to Sort by Walking and Swapping on Paths and Trees. 1151-1181 - Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. 1182-1205 - Éric Colin de Verdière:
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. 1206-1224 - Michael Dinitz, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. 1225-1245 - Yossi Azar, Oren Gilon:
Scheduling with Deadlines and Buffer Management with Processing Requirements. 1246-1262 - Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. 1263-1283
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-05-10 19:47 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:
