default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/walcom/walcom2009.bht:"
download as .bib file
@inproceedings{DBLP:conf/walcom/AbbasiHR09,
author = {Sarmad Abbasi and
Patrick Healy and
Aimal Rextin},
editor = {Sandip Das and
Ryuhei Uehara},
title = {An Improved Upward Planarity Testing Algorithm and Related Applications},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {334--344},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_29},
doi = {10.1007/978-3-642-00202-1\_29},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AbbasiHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AhmedLM09,
author = {Mustaq Ahmed and
Anna Lubiw and
Anil Maheshwari},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Shortest Gently Descending Paths},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {59--70},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_6},
doi = {10.1007/978-3-642-00202-1\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AhmedLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AltS09,
author = {Helmut Alt and
Ludmila Scharf},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Shape Matching by Random Sampling},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {381--393},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_33},
doi = {10.1007/978-3-642-00202-1\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AltS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BaeKT09,
author = {Sang Won Bae and
Matias Korman and
Takeshi Tokuyama},
editor = {Sandip Das and
Ryuhei Uehara},
title = {All Farthest Neighbors in the Presence of Highways and Obstacles},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {71--82},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_7},
doi = {10.1007/978-3-642-00202-1\_7},
timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BaeKT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BaeLC09,
author = {Sang Won Bae and
Chunseok Lee and
Sunghee Choi},
editor = {Sandip Das and
Ryuhei Uehara},
title = {On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {105--116},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_10},
doi = {10.1007/978-3-642-00202-1\_10},
timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BaeLC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BalasubramanianHR09,
author = {Balasubramanian Sivan and
S. Harini and
C. Pandu Rangan},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Core and Conditional Core Path of Specified Length in Special Classes
of Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {262--273},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_23},
doi = {10.1007/978-3-642-00202-1\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BalasubramanianHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BlinFSV09,
author = {Guillaume Blin and
Guillaume Fertin and
Florian Sikora and
St{\'{e}}phane Vialette},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {357--368},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_31},
doi = {10.1007/978-3-642-00202-1\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BlinFSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BorriCP09,
author = {Alessandro Borri and
Tiziana Calamoneri and
Rossella Petreschi},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Recognition of Unigraphs through Superposition of Graphs (Extended
Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {165--176},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_15},
doi = {10.1007/978-3-642-00202-1\_15},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/BorriCP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Brinkmeier09,
author = {Michael Brinkmeier},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Minimum Cuts of Simple Graphs in Almost Always Linear Time},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {226--237},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_20},
doi = {10.1007/978-3-642-00202-1\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Brinkmeier09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Cheong09,
author = {Otfried Cheong},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Line Transversals and Pinning Numbers},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {44--46},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_4},
doi = {10.1007/978-3-642-00202-1\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Cheong09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DasMN09,
author = {Gautam K. Das and
Debapriyay Mukhopadhyay and
Subhas C. Nandy},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Improved Algorithm for a Widest 1-Corner Corridor},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {83--92},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_8},
doi = {10.1007/978-3-642-00202-1\_8},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/DasMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DeanS09,
author = {Brian C. Dean and
Namrata Swar},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The Generalized Stable Allocation Problem},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {238--249},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_21},
doi = {10.1007/978-3-642-00202-1\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/DeanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DomFR09,
author = {Michael Dom and
Michael R. Fellows and
Frances A. Rosamond},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Parameterized Complexity of Stabbing Rectangles and Squares in the
Plane},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {298--309},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_26},
doi = {10.1007/978-3-642-00202-1\_26},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/DomFR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/FoxP09,
author = {Jacob Fox and
J{\'{a}}nos Pach},
editor = {Sandip Das and
Ryuhei Uehara},
title = {A Separator Theorem for String Graphs and Its Applications},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {1--14},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_1},
doi = {10.1007/978-3-642-00202-1\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/FoxP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/FukunagaN09,
author = {Takuro Fukunaga and
Hiroshi Nagamochi},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Network Design with Weighted Degree Constraints},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {214--225},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_19},
doi = {10.1007/978-3-642-00202-1\_19},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/FukunagaN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GhoshGMNPS09,
author = {Subir Kumar Ghosh and
Partha P. Goswami and
Anil Maheshwari and
Subhas C. Nandy and
Sudebkumar Prasant Pal and
Swami Sarvattomananda},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Algorithms for Computing Diffuse Reflection Paths in Polygons},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {47--58},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_5},
doi = {10.1007/978-3-642-00202-1\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/GhoshGMNPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GrilliHLMW09,
author = {Luca Grilli and
Seok{-}Hee Hong and
Giuseppe Liotta and
Henk Meijer and
Stephen K. Wismath},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Matched Drawability of Graph Pairs and of Graph Triples},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {322--333},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_28},
doi = {10.1007/978-3-642-00202-1\_28},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/GrilliHLMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/HasheminezhadHM09,
author = {Mahdieh Hasheminezhad and
S. Mehdi Hashemi and
Brendan D. McKay},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Spherical-Rectangular Drawings},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {345--356},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_30},
doi = {10.1007/978-3-642-00202-1\_30},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/HasheminezhadHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/HasheminezhadMR09,
author = {Mahdieh Hasheminezhad and
Brendan D. McKay and
Tristan Reeves},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Recursive Generation of 5-Regular Planar Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {129--140},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_12},
doi = {10.1007/978-3-642-00202-1\_12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/HasheminezhadMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/HermannR09,
author = {Miki Hermann and
Florian Richoux},
editor = {Sandip Das and
Ryuhei Uehara},
title = {On the Computational Complexity of Monotone Constraint Satisfaction
Problems},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {286--297},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_25},
doi = {10.1007/978-3-642-00202-1\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/HermannR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Ibarra09,
author = {Louis Ibarra},
editor = {Sandip Das and
Ryuhei Uehara},
title = {A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {190--201},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_17},
doi = {10.1007/978-3-642-00202-1\_17},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/Ibarra09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/IoannidouN09,
author = {Kyriaki Ioannidou and
Stavros D. Nikolopoulos},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Colinear Coloring on Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {117--128},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_11},
doi = {10.1007/978-3-642-00202-1\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/IoannidouN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KarakawaMN09,
author = {Seigo Karakawa and
Ehab Morsy and
Hiroshi Nagamochi},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Minmax Tree Cover in the Euclidean Space},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {202--213},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_18},
doi = {10.1007/978-3-642-00202-1\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/KarakawaMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KarimAR09,
author = {Muhammad Rezaul Karim and
Md. Jawaherul Alam and
Md. Saidur Rahman},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs
with O(nlogn) Area (Extended Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {310--321},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_27},
doi = {10.1007/978-3-642-00202-1\_27},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/KarimAR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/LittleC09,
author = {Philip Little and
Amitabh Chaudhary},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Object Caching for Queries and Updates},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {394--405},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_34},
doi = {10.1007/978-3-642-00202-1\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/LittleC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MahajanNV09,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Kasturi R. Varadarajan},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The Planar k-Means Problem is NP-Hard},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {274--285},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_24},
doi = {10.1007/978-3-642-00202-1\_24},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/MahajanNV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MchedlidzeS09,
author = {Tamara Mchedlidze and
Antonios Symvonis},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application
to Upward Topological Book Embeddings},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {250--261},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_22},
doi = {10.1007/978-3-642-00202-1\_22},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/MchedlidzeS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MunozSU09,
author = {Xavier Mu{\~{n}}oz and
Sebastian Seibert and
Walter Unger},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The Minimal Manhattan Network Problem in Three Dimensions},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {369--380},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_32},
doi = {10.1007/978-3-642-00202-1\_32},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/MunozSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ParvezRN09,
author = {Mohammad Tanvir Parvez and
Md. Saidur Rahman and
Shin{-}Ichi Nakano},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Generating All Triangulations of Plane Graphs (Extended Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {151--164},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_14},
doi = {10.1007/978-3-642-00202-1\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/ParvezRN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/RasheedHR09,
author = {Md. Muhibur Rasheed and
Masud Hasan and
M. Sohel Rahman},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Maximum Neighbour Voronoi Games},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {93--104},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_9},
doi = {10.1007/978-3-642-00202-1\_9},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/RasheedHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/SaitohYKU09,
author = {Toshiki Saitoh and
Katsuhisa Yamanaka and
Masashi Kiyomi and
Ryuhei Uehara},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Random Generation and Enumeration of Proper Interval Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {177--189},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_16},
doi = {10.1007/978-3-642-00202-1\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/SaitohYKU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Sen09,
author = {Sandeep Sen},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Approximating Shortest Paths in Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {32--43},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_3},
doi = {10.1007/978-3-642-00202-1\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Sen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/YamanakaON09,
author = {Katsuhisa Yamanaka and
Yota Otachi and
Shin{-}Ichi Nakano},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {141--150},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_13},
doi = {10.1007/978-3-642-00202-1\_13},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/YamanakaON09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/YapY09,
author = {Chee{-}Keng Yap and
Jihun Yu},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Foundations of Exact Rounding},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {15--31},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_2},
doi = {10.1007/978-3-642-00202-1\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/YapY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/walcom/2009,
editor = {Sandip Das and
Ryuhei Uehara},
title = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1},
doi = {10.1007/978-3-642-00202-1},
isbn = {978-3-642-00201-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2025-01-31 21:40 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
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:
