![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 34 matches
- 2007
- Ernst Althaus, Tobias Baumann, Elmar Schömer
, Kai Werth:
Trunk Packing Revisited. WEA 2007: 420-432 - Eyjolfur Ingi Asgeirsson, Clifford Stein:
Vertex Cover Approximations on Random Graphs. WEA 2007: 285-296 - Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269 - Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA 2007: 406-419 - Markus Behle, Michael Jünger, Frauke Liers
:
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. WEA 2007: 379-392 - Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler:
Crossing Minimization in Weighted Bipartite Graphs. WEA 2007: 122-135 - Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos:
An Experimental Study of Stability in Heterogeneous Networks. WEA 2007: 189-202 - Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
An Alternative Ranking Problem for Search Engines. WEA 2007: 1-22 - Vladimir G. Deineko, Alexandre Tiskin
:
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149 - Daniel Delling, Dorothea Wagner:
Landmark-Based Routing in Dynamic Graphs. WEA 2007: 52-65 - Friedrich Eisenbrand, Andreas Karrenbauer
, Chihao Xu:
Algorithms for Longer OLED Lifetime. WEA 2007: 338-351 - Angelo Fanelli
, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. WEA 2007: 324-337 - Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284 - Karina Figueroa, Kimmo Fredriksson:
Simple Space-Time Trade-Offs for AESA. WEA 2007: 229-241 - Kimmo Fredriksson, Fedor Nikitin:
Simple Compression Code Supporting Random Access and Fast String Matching. WEA 2007: 203-216 - Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. WEA 2007: 38-51 - Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia:
On the Cost of Persistence and Authentication in Skip Lists. WEA 2007: 94-107 - Dries R. Goossens, Frits C. R. Spieksma
:
Exact Algorithms for the Matrix Bid Auction. WEA 2007: 433-445 - Falk Hüffner
, Nadja Betzler, Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310 - Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases. WEA 2007: 365-378 - Jens Maue, Peter Sanders:
Engineering Algorithms for Approximate Weighted Matching. WEA 2007: 242-255 - Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa:
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. WEA 2007: 150-160 - Olivier Powell, Sotiris E. Nikoletseas:
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks. WEA 2007: 161-174 - Felix Putze, Peter Sanders, Johannes Singler:
Cache-, Hash- and Space-Efficient Bloom Filters. WEA 2007: 108-121 - Celso C. Ribeiro
, Rodrigo F. Toso:
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights. WEA 2007: 393-405 - Peter Sanders, Dominik Schultes:
Engineering Fast Route Planning Algorithms. WEA 2007: 23-36 - Marcelo C. P. Santos, Lúcia M. A. Drummond
, Eduardo Uchoa:
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. WEA 2007: 175-188 - Dominik Schultes, Peter Sanders:
Dynamic Highway-Node Routing. WEA 2007: 66-79 - Maria J. Serna:
Random Models for Geometric Graphs (Abstract). WEA 2007: 37 - Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz:
Algorithms for the Balanced Edge Partitioning Problem. WEA 2007: 311-323
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-23 11:51 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