default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. WALCOM 2010: Dhaka, Bangladesh
- Md. Saidur Rahman, Satoshi Fujita:
WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings. Lecture Notes in Computer Science 5942, Springer 2010, ISBN 978-3-642-11439-7
Invited Talks
- Jacob Fox, Fabrizio Frati
, János Pach, Rom Pinchasi:
Crossings between Curves with Many Tangencies. 1-8 - Tetsuo Asano, Wolfgang Mulzer, Yajun Wang:
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. 9-20 - Subir Kumar Ghosh:
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. 21-34 - Emilio Di Giacomo, Giuseppe Liotta:
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. 35-46
Graph Drawing
- Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small Grid Drawings of Planar Graphs with Balanced Bipartition. 47-57 - Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planar Embeddings of Trees. 58-69 - Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
A Global k-Level Crossing Reduction Algorithm. 70-81
Computational Geometry
- Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. 82-93 - Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam:
Cutting a Convex Polyhedron Out of a Sphere. 94-101 - Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. 102-112
Graph Algorithms I
- Patrizio Angelini, Fabrizio Frati:
Acyclically 3-Colorable Planar Graphs. 113-124 - Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithm for Permutation Graphs. 125-135 - Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Harmonious Coloring on Subclasses of Colinear Graphs. 136-148
Computational Biology and Strings
- Guillaume Blin, Sylvie Hamel, Stéphane Vialette:
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. 149-160 - Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. 161-166 - Saverio Caminiti, Rossella Petreschi:
Parallel Algorithms for Encoding and Decoding Blob Code. 167-178
Combinatorial Optimization
- Naoki Katoh, Shin-ichi Tanigawa:
A Rooted-Forest Partition with Uniform Vertex Demand. 179-190 - Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki:
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. 191-203
Graph Algorithms II
- Ling-Ju Hung, Ton Kloks:
On Some Simple Widths. 204-215 - Takeya Shigezumi, Yushi Uno, Osamu Watanabe:
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. 216-227
Approximation Algorithms
- Sandeep Sen, V. N. Muralidhara:
The Covert Set-Cover Problem with Application to Network Discovery. 228-239 - T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan:
Variants of Spreading Messages. 240-251 - Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan:
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. 252-262 - Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-bin Li:
Real Root Isolation of Multi-Exponential Polynomials with Application. 263-268
Parameterized Complexity
- Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. 269-280 - Mingyu Xiao:
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. 281-292 - D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan:
Pathwidth and Searching in Parameterized Threshold Graphs. 293-304
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 2026-07-15 00:48 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
