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 40 matches
- 2010
- Anna Adamaszek, Alexandru Popa:
Approximation and Hardness Results for the Maximum Edge q-coloring Problem. ISAAC (2) 2010: 132-143 - Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher:
Maximum Overlap of Convex Polytopes under Translation. ISAAC (2) 2010: 97-108 - Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433 - John Augustine, Nick Gravin:
On the Continuous CNN Problem. ISAAC (2) 2010: 254-265 - Sang Won Bae, Chan-Su Shin:
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract). ISAAC (2) 2010: 230-241 - Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326 - Binay K. Bhattacharya, Yuzhuang Hu:
Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) 2010: 192-205 - Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen:
A Cache-Oblivious Implicit Dictionary with the Working Set Property. ISAAC (2) 2010: 37-48 - Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis:
D2-Tree: A New Overlay with Deterministic Bounds. ISAAC (2) 2010: 1-12 - Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167 - Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman:
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179 - Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao:
Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) 2010: 339-350 - Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang:
Approximate Shortest Homotopic Paths in Weighted Regions. ISAAC (2) 2010: 109-120 - Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On Greedy Algorithms for Decision Trees. ISAAC (2) 2010: 206-217 - Amr Elmasry:
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. ISAAC (2) 2010: 375-386 - Arash Farzan, Travis Gagie, Gonzalo Navarro:
Entropy-Bounded Representation of Point Grids. ISAAC (2) 2010: 327-338 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 - Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon:
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. ISAAC (2) 2010: 121-131 - Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) 2010: 85-96 - Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity When the Common Graph Is 2-Connected. ISAAC (2) 2010: 410-421 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60 - Pinar Heggernes, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409 - Sun-Yuan Hsieh, Chun-An Chen:
Computing the (t, k)-Diagnosability of Component-Composition Graphs and Its Application. ISAAC (2) 2010: 363-374 - Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362 - Minghui Jiang:
Approximability of Constrained LCS. ISAAC (2) 2010: 180-191 - Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki:
k-cyclic Orientations of Graphs. ISAAC (2) 2010: 73-84 - Henning Meyerhenke:
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization. ISAAC (2) 2010: 387-398 - Yakov Nekrich:
Dynamic Range Reporting in External Memory. ISAAC (2) 2010: 25-36
skipping 10 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-09-24 02:20 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