![](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 68 matches
- 2008
- Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735 - Sergey A. Afonin:
The View Selection Problem for Regular Path Queries. LATIN 2008: 121-132 - Ali Akhavi, Damien Stehlé:
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). LATIN 2008: 293-305 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
, Shakhar Smorodinsky
:
Coloring Geometric Range Spaces. LATIN 2008: 146-157 - Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
List Update with Locality of Reference. LATIN 2008: 399-410 - Stanislav Angelov, Keshav Kunal, Andrew McGregor:
Sorting and Selection with Random Costs. LATIN 2008: 48-59 - Baruch Awerbuch, Rohit Khandekar:
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN 2008: 580-592 - Kooshiar Azimian, Mario Szegedy:
Parallel Repetition of the Odd Cycle Game. LATIN 2008: 676-686 - Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. LATIN 2008: 240-251 - Mukul S. Bansal, Jianrong Dong, David Fernández-Baca:
Comparing and Aggregating Partially Resolved Trees. LATIN 2008: 72-83 - Imre Bárány, Attila Pór, Pavel Valtr:
Paths with no Small Angles. LATIN 2008: 654-663 - Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 - Marshall W. Bern, Barry Hayes:
Origami Embedding of Piecewise-Linear Two-Manifolds. LATIN 2008: 617-629 - Marcin Bienkowski, Aleksander Madry:
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. LATIN 2008: 252-263 - Paul S. Bonsma, Florian Zickfeld:
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. LATIN 2008: 531-543 - Prosenjit Bose
, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin
, Michiel H. M. Smid:
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - Andreas Brandstädt, Christian Hundt:
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN 2008: 479-491 - Binh-Minh Bui-Xuan, Michel Habib
:
A Representation Theorem for Union-Difference Families and Application. LATIN 2008: 492-503 - Christine T. Cheng:
The Generalized Median Stable Matchings: Finding Them Is Not That Easy. LATIN 2008: 568-579 - Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server. LATIN 2008: 228-239 - Gérard Cornuéjols, François Margot:
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. LATIN 2008: 317-328 - Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis
, Jaroslav Opatrny, Jorge Urrutia:
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 - Hervé Daudé, Vlady Ravelomanana:
Random 2-XORSAT at the Satisfiability Threshold. LATIN 2008: 12-23 - Brian C. Dean, Adam Griffis, Adam A. Whitley:
Approximation Algorithms for k-Hurdle Problems. LATIN 2008: 449-460 - Domingos Dellamonica Jr.:
Simpler Constant-Seed Condensers. LATIN 2008: 664-675 - Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi:
Energy Efficient Monitoring in Sensor Networks. LATIN 2008: 436-448 - Feodor F. Dragan, Chenyu Yan, Yang Xiang:
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. LATIN 2008: 555-567 - Andrzej Dudek, Vojtech Rödl:
New Upper Bound on Vertex Folkman Numbers. LATIN 2008: 473-478 - Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfish Agents. LATIN 2008: 264-275 - Thomas Erlebach
, Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs. LATIN 2008: 747-758
skipping 38 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-06-20 13:31 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