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 24 matches
- 2012
- Christian Bachmaier, Marco Matzeder:
Drawing Unordered Trees on k-Grids. WALCOM 2012: 198-210 - Sang Won Bae:
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments. WALCOM 2012: 40-51 - Sang Won Bae, Kyung-Yong Chwa:
Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract). WALCOM 2012: 28-39 - Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM 2012: 76-87 - Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall Tau Distances. WALCOM 2012: 88-99 - Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM 2012: 124-135 - Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli:
Range Aggregate Maximal Points in the Plane. WALCOM 2012: 52-63 - Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma:
Approximating the Multi-level Bottleneck Assignment Problem. WALCOM 2012: 64-75 - Stephane Durocher, Debajyoti Mondal:
On the Hardness of Point-Set Embeddability - (Extended Abstract). WALCOM 2012: 148-159 - Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters. WALCOM 2012: 173-185 - Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. WALCOM 2012: 186-197 - Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo:
Heuristics for the Maximum 2-layer RAC Subgraph Problem. WALCOM 2012: 211-216 - Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman, Sammi Abida Salma:
Universal Line-Sets for Drawing Planar 3-Trees. WALCOM 2012: 136-147 - Kazuo Iwama:
Approximability of Stable Matching Problems. WALCOM 2012: 2 - Yasushi Kawase, Kazuhisa Makino:
Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM 2012: 217-228 - R. Krithika, N. S. Narayanaswamy:
Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM 2012: 17-27 - Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz:
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract). WALCOM 2012: 160-172 - Sammi Abida Salma, Md. Saidur Rahman:
Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs. WALCOM 2012: 112-123 - Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. WALCOM 2012: 229-240 - Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16 - Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen:
On the Round-Trip 1-Center and 1-Median Problems. WALCOM 2012: 100-111 - Sue Whitesides:
On Three-Dimensional Graph Drawing and Embedding. WALCOM 2012: 3-4 - Peter Widmayer:
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? WALCOM 2012: 1 - Md. Saidur Rahman, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7157, Springer 2012, ISBN 978-3-642-28075-7 [contents]
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-10-28 10:03 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