default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. WALCOM 2014: Chennai, India
- Sudebkumar Prasant Pal, Kunihiko Sadakane:
Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Lecture Notes in Computer Science 8344, Springer 2014, ISBN 978-3-319-04656-3
Invited Papers
- Kurt Mehlhorn:
Algorithms for Equilibrium Prices in Linear Market Models. 1-4 - J. Ian Munro:
In as Few Comparisons as Possible. 5-6 - Pavel Valtr:
The Happy End Theorem and Related Results. 7
Computational Geometry
- Apurva Mudgal, Supantha Pandit:
Generalized Class Cover Problem with Axis-Parallel Strips. 8-21 - Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
:
Top-k Manhattan Spatial Skyline Queries. 22-33 - Nadeem Moidu, Jatin Agarwal, Sankalp Khare, Kishore Kothapalli, Kannan Srinathan:
On Generalized Planar Skyline and Convex Hull Range Queries. 34-43 - Zhi-Dong Huang, Sheung-Hung Poon, Chun-Cheng Lin:
Boundary Labeling with Flexible Label Positions. 44-55
Algorithms and Approximations
- Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
Approximating the Bipartite TSP and Its Biased Generalization. 56-67 - Jean-François Baffier, Vorapong Suppakitpaisarn:
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow. 68-79 - Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth:
Simple Linear Comparison of Strings in V-Order - (Extended Abstract). 80-89 - Nils M. Kriege, Petra Mutzel, Till Schäfer:
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. 90-101
Distributed Computing and Networks
- Satoshi Fujita:
Optimal Serial Broadcast of Successive Chunks. 102-113 - Jazmín Romero, Alejandro López-Ortiz:
The ${\mathcal{G}}$ -Packing with t-Overlap Problem. 114-124 - Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. 125-137 - Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom:
On a Class of Covering Problems with Variable Capacities in Wireless Networks. 138-150
Graph Algorithms
- B. S. Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. 151-162 - Subir Kumar Ghosh, Bodhayan Roy:
Some Results on Point Visibility Graphs. 163-175 - Tong-Wook Shinn, Tadao Takaoka:
Some Extensions of the Bottleneck Paths Problem. 176-187 - Alka Bhushan, Sajith Gopalan:
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs. 188-199
Complexity and Bounds
- Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On Some $\mathcal{NP}$ -complete SEFE Problems. 200-212 - Tiziana Calamoneri, Rossella Petreschi:
On Dilworth k Graphs and Their Pairwise Compatibility. 213-224 - Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. 225-236 - Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang:
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio. 237-248 - Peter Damaschke, Olof Mogren:
Editing the Simplest Graphs. 249-260 - Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with Non-overlapping Inversions on Two Strings. 261-272 - Nikhil Balaji, Samir Datta:
Collapsing Exact Arithmetic Hierarchies. 273-285 - Jiong Guo, Yash Raj Shrestha:
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. 286-297
Graph Embeddings and Drawings
- Carla Binucci, Walter Didimo:
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. 298-309 - N. S. Narayanaswamy, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. 310-321 - Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
Linear Layouts of Weakly Triangulated Graphs. 322-336 - Khaled Mahmud Shahriar, Md. Saidur Rahman:
Bichromatic Point-Set Embeddings of Trees with Fewer Bends - (Extended Abstract). 337-348 - Norie Fu:
ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs. 349-360
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-12-31 21:53 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:
