default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th WALCOM 2019: Guwahati, India
- Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings. Lecture Notes in Computer Science 11355, Springer 2019, ISBN 978-3-030-10563-1
Invited Talks
- Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Profile Realizations and Applications to Social Networks. 3-14 - Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Parameterized Computational Geometry via Decomposition Theorems. 15-27
Facility Location Problem
- Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
r-Gatherings on a Star. 31-42 - Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-centers. 43-55 - Anik Sarker, Wing-Kin Sung, M. Sohel Rahman:
A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). 56-66
Computational Geometry
- Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-Width Empty Square and Rectangular Annulus. 69-81 - Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia, Marcos Villagra:
Hard and Easy Instances of L-Tromino Tilings. 82-95 - Christian Scheffer:
The Prefix Fréchet Similarity. 96-107 - Stefan Klootwijk, Bodo Manthey, Sander K. Visser:
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics. 108-120 - Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. 121-132
Graph Drawing
- Yiyang Jia, Yoshihiro Kanamori, Jun Mitani:
Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns. 135-147 - Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Relaxation of Hybrid Planarity. 148-159 - Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Graphs on Disk Arrangements. 160-171
Graph Algorithms
- Duygu Vietz, Stefan Hoffmann, Egon Wanke:
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). 175-187 - Yanamandram B. Venkatakrishnan, H. Naresh Kumar:
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. 188-198 - Shuji Jimbo, Akira Maruoka:
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. 199-208 - Takuya Tamori, Kei Kimura:
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition. 209-218 - Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. 219-231
Approximation Algorithms
- Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. 235-247 - Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. - Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. 248-260 - Hyeyun Yang, Antoine Vigneron:
Matching Sets of Line Segments. 261-273
Miscellaneous
- Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. 277-288 - Ajinkya Borle, Samuel J. Lomonaco:
Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems. 289-301
Data Structures
- Wing-Kin Sung:
Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems. 305-316 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
A Two Query Adaptive Bitprobe Scheme Storing Five Elements. 317-328 - Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth:
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. 329-338
Parallel and Distributed Algorithms
- Max Bannach, Malte Skambath, Till Tantau:
Towards Work-Efficient Parallel Parameterized Algorithms. 341-353 - Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots. 354-366
Packing and Covering
- Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf:
Packing 2D Disks into a 3D Container. 369-380 - Satyabrata Jana, Supantha Pandit:
Covering and Packing of Rectilinear Subdivision. 381-393 - Joseph S. B. Mitchell, Supantha Pandit:
Minimum Membership Covering and Hitting. 394-406 - Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated Discrete Unit Disk Cover. 407-418
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-08 20:17 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:
