![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 49 matches
- 2017
- Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
:
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78(1): 342-377 (2017) - Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. Algorithmica 78(2): 492-520 (2017) - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
:
Distribution-Sensitive Construction of the Greedy Spanner. Algorithmica 78(1): 209-231 (2017) - Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. Algorithmica 78(1): 47-85 (2017) - Elliot Anshelevich
, Onkar Bhardwaj
, Martin Hoefer:
Stable Matching with Network Externalities. Algorithmica 78(3): 1067-1106 (2017) - Yossi Azar
, Oren Gilon:
Scheduling with Deadlines and Buffer Management with Processing Requirements. Algorithmica 78(4): 1246-1262 (2017) - Evangelos Bampas
, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - Nikhil Bansal, Irene Finocchi
:
Guest Editors' Foreword. Algorithmica 78(4): 1107-1108 (2017) - Paola Bonizzoni
, Gianluca Della Vedova
, Yuri Pirola
, Marco Previtali
, Raffaella Rizzi
:
An External-Memory Algorithm for String Graph Construction. Algorithmica 78(2): 394-424 (2017) - Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren:
Strategyproof Mechanisms for Competitive Influence in Networks. Algorithmica 78(2): 425-452 (2017) - 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. Algorithmica 78(3): 990-1019 (2017) - Timothy M. Chan, Meng He
, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications. Algorithmica 78(2): 453-491 (2017) - Jiecao Chen, Qin Zhang
:
Improved Algorithms for Distributed Entropy Monitoring. Algorithmica 78(3): 1041-1066 (2017) - Rajesh Chitnis
, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. Algorithmica 78(1): 110-146 (2017) - Dogan Corus
, Jun He
, Thomas Jansen
, Pietro S. Oliveto
, Dirk Sudholt, Christine Zarges
:
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica 78(2): 714-740 (2017) - Basile Couëtoux, Elie Nakache, Yann Vaxès:
The Maximum Labeled Path Problem. Algorithmica 78(1): 298-318 (2017) - Duc-Cuong Dang
, Thomas Jansen
, Per Kristian Lehre:
Populations Can Be Essential in Tracking Dynamic Optima. Algorithmica 78(2): 660-680 (2017) - Hu Ding, Jinhui Xu:
FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems. Algorithmica 78(3): 741-770 (2017) - Michael Dinitz
, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. Algorithmica 78(4): 1225-1245 (2017) - Carola Doerr
, Francisco Chicano
:
Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica 78(2): 558-560 (2017) - Carola Doerr
, Johannes Lengler
:
OneMax in Black-Box Models with Several Restrictions. Algorithmica 78(2): 610-640 (2017) - Benjamin Doerr, Frank Neumann
, Andrew M. Sutton
:
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 78(2): 561-586 (2017) - Hicham El-Zein
, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - Guy Even, Moti Medina
:
Online Packet-Routing in Grids with Bounded Buffers. Algorithmica 78(3): 819-868 (2017) - Uriel Feige, Moshe Tennenholtz:
Optimization with Uniform Size Queries. Algorithmica 78(1): 255-273 (2017) - Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - 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. Algorithmica 78(3): 914-944 (2017) - Frantisek Galcík, Ján Katrenic, Gabriel Semanisin
:
On Computing an Optimal Semi-matching. Algorithmica 78(3): 896-913 (2017) - Kyle Genova, David P. Williamson
:
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem. Algorithmica 78(4): 1109-1130 (2017) - Christian Gießen, Carsten Witt
:
The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax. Algorithmica 78(2): 587-609 (2017)
skipping 19 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-01 21:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint