![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.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 43 matches
- 2010
- Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa
, Eduardo Uchoa
:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA 2010: 202-213 - Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks. SEA 2010: 23-34 - Edoardo Amaldi, Stefano Coniglio
, Stefano Gualandi
:
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA 2010: 266-275 - Daniela Ambrosino
, Davide Anghinolfi, Massimo Paolucci
, Anna Sciomachen:
An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem. SEA 2010: 314-325 - Hakob Aslanyan, Pierre Leone, José D. P. Rolim:
Data Propagation with Guaranteed Delivery for Mobile Networks. SEA 2010: 386-397 - Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng:
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. SEA 2010: 361-372 - Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty:
Realtime Classification for Encrypted Traffic. SEA 2010: 373-385 - Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders:
Time-Dependent Contraction Hierarchies and Approximation. SEA 2010: 166-177 - Frank Baumann, Christoph Buchheim
, Frauke Liers
:
Exact Bipartite Crossing Minimization under Tree Constraints. SEA 2010: 118-128 - Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann
:
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. SEA 2010: 35-46 - Maurizio Boccia, Teodor Gabriel Crainic
, Antonio Sforza, Claudio Sterle
:
A Metaheuristic for a Two Echelon Location-Routing Problem. SEA 2010: 288-301 - Joan Boyar
, René Peralta:
A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA 2010: 178-189 - Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner:
Space-Efficient SHARC-Routing. SEA 2010: 47-58 - Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen:
Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA 2010: 424-435 - Rodrigo Cánovas
, Gonzalo Navarro:
Practical Compressed Suffix Trees. SEA 2010: 94-105 - Manuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, Camille Wormser:
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. SEA 2010: 462-473 - Samidh Chatterjee, Michael Connor, Piyush Kumar:
Geometric Minimum Spanning Trees with GeoFilterKruskal. SEA 2010: 486-500 - Marco Chiarandini, Thomas Stützle
:
An Analysis of Heuristics for Vertex Colouring. SEA 2010: 326-337 - Serafino Cicerone
, Gianlorenzo D'Angelo
, Gabriele Di Stefano, Daniele Frigioni
, Vinicio Maurizio:
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70 - Michael Connor, Piyush Kumar:
Practical Nearest Neighbor Search in the Plane. SEA 2010: 501-512 - Eamonn T. Coughlan, Marco E. Lübbecke
, Jens Schulz:
A Branch-and-Price Algorithm for Multi-mode Resource Leveling. SEA 2010: 226-238 - Claudia D'Ambrosio
, Antonio Frangioni
, Leo Liberti
, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360 - Charles Delort, Olivier Spanjaard:
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem. SEA 2010: 253-265 - Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA 2010: 190-201 - Branislav Durian, Hannu Peltola, Leena Salmela
, Jorma Tarhio
:
Bit-Parallel Search Algorithms for Long Patterns. SEA 2010: 129-140 - Paola Festa, José Fernando Gonçalves
, Mauricio G. C. Resende, Ricardo M. A. Silva:
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. SEA 2010: 338-349 - Gerald Gamrath
, Marco E. Lübbecke
:
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. SEA 2010: 239-252 - Robert Geisberger:
Contraction of Timetable Networks with Realistic Transfers. SEA 2010: 71-82 - Robert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner:
Modularity-Driven Clustering of Dynamic Graphs. SEA 2010: 436-448 - Lucio Grandinetti, Francesca Guerriero
, Demetrio Laganà
, Ornella Pisacane
:
An Approximate epsilon-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem. SEA 2010: 214-225
skipping 13 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.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-08-18 13:35 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