default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. WALCOM 2015: Dhaka, Bangladesh
- M. Sohel Rahman
, Etsuji Tomita:
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings. Lecture Notes in Computer Science 8973, Springer 2015, ISBN 978-3-319-15611-8
Invited Contribution
- Rajeev Raman:
Encoding Data Structures. 1-7
Approximation Algorithms
- Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy:
Fast Algorithms for Constrained Graph Density Problems. 8-19 - Li Guan, Jianping Li, Xuejie Zhang, Weidong Li:
The Directed Ring Loading with Penalty Cost. 20-31 - Yuji Obata, Takao Nishizeki:
Edge-Colorings of Weighted Graphs - (Extended Abstract). 32-43 - Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Unit Covering in Color-Spanning Set Model. 44-52
Data Structures and Algorithms
- Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti:
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. 53-64 - Johannes Fischer, Daniel Peters:
A Practical Succinct Data Structure for Tree-Like Graphs. 65-76 - Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao:
Forming Plurality at Minimum Cost. 77-88 - Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna:
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. 89-100
Computational Geometry
- Mark de Berg, Ali D. Mehrabi:
Straight-Path Queries in Trajectory Data. 101-112 - Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. 113-124 - Sang Won Bae:
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract). 125-136
Combinatorial Algorithms
- Santiago Valdés Ravelo, Carlos E. Ferreira:
PTAS's for Some Metric p-source Communication Spanning Tree Problems. 137-148 - Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement. 149-160 - Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato:
Enumerating Eulerian Trails via Hamiltonian Path Enumeration. 161-174
Distributed and Online Algorithms
- Thim Strothmann:
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees. 175-186 - Yuma Asada, Michiko Inoue:
An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks. 187-198 - Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson:
Dynamic Online Multiselection in Internal and External Memory. 199-209 - Morten Tiedemann, Jonas Ide, Anita Schöbel:
Competitive Analysis for Multi-objective Online Algorithms. 210-221 - Morten Tiedemann, Jonas Ide, Anita Schöbel:
Erratum: Competitive Analysis for Multi-objective Online Algorithms. E1-E2
Graph Drawing and Algorithms
- Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. 222-233 - Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. 234-245 - Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth:
On Bar (1, j)-Visibility Graphs - (Extended Abstract). 246-257 - Diptarka Chakraborty, Raghunath Tewari:
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. 258-269
Combinatorial Problems and Complexity
- Neerja Mhaskar, Michael Soltys:
Non-repetitive Strings over Alphabet Lists. 270-281 - Christian Engels:
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. 282-293 - Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. 294-305 - Kei Uchizawa, Daiki Yashima, Xiao Zhou:
Threshold Circuits for Global Patterns in 2-Dimensional Maps. 306-316
Graph Enumeration and Algorithms
- Takahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato:
Superset Generation on Decision Diagrams. 317-322 - Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, Md. Saidur Rahman:
On Triangle Cover Contact Graphs. 323-328 - Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. 329-334
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-11-15 19:19 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:
