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 117 matches
- 2005
- David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn:
Pareto Optimality in House Allocation Problems. ISAAC 2005: 1163-1175 - Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684 - Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu:
Monitoring Continuous Band-Join Queries over Dynamic Data. ISAAC 2005: 349-359 - Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core. ISAAC 2005: 40-49 - Hee-Kap Ahn, Otfried Cheong:
Stacking and Bundling Two Convex Polygons. ISAAC 2005: 882-891 - Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798 - Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi:
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. ISAAC 2005: 298-307 - Carme Àlvarez, Joaquim Gabarró, Maria J. Serna:
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, . ISAAC 2005: 634-643 - Lars Arge, Laura Toma:
External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC 2005: 328-338 - Hiroki Arimura, Takeaki Uno:
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ISAAC 2005: 724-737 - Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - Diego Arroyuelo, Gonzalo Navarro:
Space-Efficient Construction of LZ-Index. ISAAC 2005: 1143-1152 - Christian Bachmaier, Ulrik Brandes, Barbara Schlieper:
Drawing Phylogenetic Trees. ISAAC 2005: 1110-1121 - Sang Won Bae, Kyung-Yong Chwa:
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. ISAAC 2005: 1007-1018 - Cristina Bazgan, Marek Karpinski:
On the Complexity of Global Constraint Satisfaction. ISAAC 2005: 624-633 - Fabrice Bazzaro, Cyril Gavoille:
Localized and Compact Data-Structure for Comparability Graphs. ISAAC 2005: 1122-1131 - Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703 - Anders Bergkvist, Peter Damaschke:
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. ISAAC 2005: 714-723 - Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang:
Correlation Clustering and Consensus Clustering. ISAAC 2005: 226-235 - Qingbo Cai, Vincenzo Liberatore:
Approximation Algorithms for Layered Multicast Scheduling. ISAAC 2005: 974-983 - Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Basic Computations in Wireless Networks. ISAAC 2005: 533-542 - Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Network Load Games. ISAAC 2005: 809-818 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Coloring. ISAAC 2005: 819-828 - Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ISAAC 2005: 665-674 - Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135 - Zhixiang Chen, Bin Fu:
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. ISAAC 2005: 216-225 - Danny Z. Chen, Xiaobo Sharon Hu, Shuang (Sean) Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu:
Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. ISAAC 2005: 1176-1186 - Erdong Chen, Hao Yuan, Linji Yang:
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. ISAAC 2005: 1153-1162 - Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved Algorithms for the k Maximum-Sums Problems. ISAAC 2005: 799-808
skipping 87 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-23 20:43 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