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