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 61 matches
- 2010
- Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri:
Lipschitz Unimodal and Isotonic Regression on Paths and Trees. LATIN 2010: 384-396 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian:
Matching Points with Things. LATIN 2010: 456-467 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13 - Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. LATIN 2010: 38-48 - Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo:
Approximating Maximum Diameter-Bounded Subgraphs. LATIN 2010: 615-626 - Per Austrin, Siavosh Benabbas, Avner Magen:
On Quadratic Threshold CSPs. LATIN 2010: 332-343 - Jonathan Backer, J. Mark Keil:
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. LATIN 2010: 14-25 - Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Tilings Robust to Errors. LATIN 2010: 480-491 - Jérémy Barbay, Francisco Claude, Gonzalo Navarro:
Compact Rich-Functional Binary Relation Representations. LATIN 2010: 170-183 - Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
Complexity of Operations on Cofinite Languages. LATIN 2010: 222-233 - MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Euclidean Prize-Collecting Steiner Forest. LATIN 2010: 503-514 - Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised Broadcasting: Memory vs. Randomness. LATIN 2010: 306-319 - Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71 - René van Bevern, Hannes Moser, Rolf Niedermeier:
Kernelization through Tidying. LATIN 2010: 527-538 - Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk:
Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN 2010: 492-502 - Beate Bollig:
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. LATIN 2010: 255-266 - Paul S. Bonsma, Felix Breuer:
Counting Hexagonal Patches and Independent Sets in Circle Graphs. LATIN 2010: 603-614 - Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293 - Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. LATIN 2010: 686-696 - Andreas Brandstädt, Christian Hundt, Ragnar Nevries:
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. LATIN 2010: 650-661 - Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient Complexity of Ideal Languages. LATIN 2010: 208-221 - Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The Interval Constrained 3-Coloring Problem. LATIN 2010: 591-602 - Qi Cheng, Yu-Hsin Li:
Finding the Smallest Gap between Sums of Square Roots. LATIN 2010: 446-455 - Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Power of Fair Pricing Mechanisms. LATIN 2010: 554-564 - Hagai Cohen, Ely Porat:
Fast Set Intersection and Two-Patterns Matching. LATIN 2010: 234-242 - Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil:
Faithful Representations of Graphs by Islands in the Extended Grid. LATIN 2010: 131-142 - Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Rank Selection in Multidimensional Data. LATIN 2010: 674-685 - Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. LATIN 2010: 433-445 - Kunal Dutta, C. R. Subramanian:
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. LATIN 2010: 627-637 - Paolo Ferragina, Travis Gagie, Giovanni Manzini:
Lightweight Data Indexing and Compression in External Memory. LATIN 2010: 697-710
skipping 31 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-11-03 09:07 CET 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