Остановите войну!
for scientists:
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
- 2004
- Pankaj K. Agarwal, Nabil H. Mustafa:
Independent Set of Intersection Graphs of Convex Objects in 2D. SWAT 2004: 127-137 - Nir Andelman, Yishay Mansour:
Auctions with Budget Constraints. SWAT 2004: 26-38 - Lars Arge, Laura Toma:
Simplified External Memory Algorithms for Planar DAGs. SWAT 2004: 493-503 - Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 - Adi Avidor, Michael Langberg:
The Multi-multiway Cut Problem. SWAT 2004: 273-284 - Yossi Azar, Shai Taub:
All-Norm Approximation for Scheduling on Identical Machines. SWAT 2004: 298-310 - Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally Competitive List Batching. SWAT 2004: 77-89 - Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT 2004: 138-149 - Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 - Joan Boyar, Paul Medvedev:
The Relative Worst Order Ratio Applied to Seat Reservation. SWAT 2004: 90-101 - Gerth Stølting Brodal:
Cache-Oblivious Algorithms and Data Structures. SWAT 2004: 3-13 - Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh:
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT 2004: 480-492 - Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441 - Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang:
Construction of the Nearest Neighbor Embracing Graph of a Point Set. SWAT 2004: 150-160 - Miroslav Chlebík, Janka Chlebíková:
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. SWAT 2004: 174-186 - Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT 2004: 248-259 - Feodor F. Dragan, Chenyu Yan, Irina Lomonosov:
Collective Tree Spanners of Graphs. SWAT 2004: 64-76 - Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247 - Amr Elmasry:
Layered Heaps. SWAT 2004: 212-222 - Leah Epstein, Rob van Stee:
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. SWAT 2004: 408-419 - Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113 - Leszek Gasieniec, Tomasz Radzik, Qin Xin:
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. SWAT 2004: 397-407 - Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer:
Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT 2004: 199-211 - Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 - Refael Hassin, Danny Segev:
Robust Subgraphs for Trees and Paths. SWAT 2004: 51-63 - Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
Pointed Binary Encompassing Trees. SWAT 2004: 442-454 - Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. SWAT 2004: 349-361 - Klaus Jansen:
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. SWAT 2004: 311-322 - Klaus Jansen, Guochuan Zhang:
Maximizing the Number of Packed Rectangles. SWAT 2004: 362-371 - Raja Jothi, Balaji Raghavachari:
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT 2004: 336-348
skipping 13 more matches
loading more results
failed to load more results, please try again later
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-05-13 02:25 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