default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. WALCOM 2013: Kharagpur, India
- Subir Kumar Ghosh, Takeshi Tokuyama
:
WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings. Lecture Notes in Computer Science 7748, Springer 2013, ISBN 978-3-642-36064-0
Invited Talks
- Nicola Santoro:
Mobility and Computations: Some Open Research Directions. 1-3 - Rina Panigrahy:
Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries. 4
Computational Geometry
- Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
A Novel Efficient Approach for Solving the Art Gallery Problem. 5-16 - Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. 17-28 - Sándor P. Fekete, Sophia Rex, Christiane Schmidt:
Online Exploration and Triangulation in Orthogonal Polygonal Regions. 29-40 - Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt:
A Competitive Strategy for Distance-Aware Online Shape Allocation. 41-52 - Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base Location Problems for Base-Monotone Regions. 53-64 - Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Counting Maximal Points in a Query Orthogonal Rectangle. 65-76 - Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. 77-88
Approximation and Randomized Algorithms
- Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky:
Approximation Schemes for Covering and Packing. 89-100 - Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Hitting Set Problem. 101-113 - Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and Approximation Algorithms for Densest k-Subgraph. 114-125 - Christophe Crespelle, Philippe Gambette:
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. 126-136 - Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation Algorithms for the Partition Vertex Cover Problem. 137-145
Parallel and Distributed Computing
- Wayne Goddard, Pradip K. Srimani:
Daemon Conversions in Distributed Self-stabilizing Algorithms. 146-157 - Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco:
Broadcasting in Conflict-Aware Multi-channel Networks. 158-169 - Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato:
Shared-Memory Parallel Frontier-Based Search. 170-181
Graph Algorithms
- Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. 182-193 - Jiawei Gao, Ton Kloks, Sheung-Hung Poon:
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs. 194-205 - Martin Olsen, Morten Revsbæk:
Alliances and Bisection Width for Planar Graphs. 206-216 - Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti:
The Cyclical Scheduling Problem. 217-232
Complexity and Bounds
- Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized Rainbow Connectivity of Graphs. 233-244 - Peter Damaschke, Ömer Egecioglu, Leonid Molokov:
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. 245-256 - Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs. 257-264 - Venkatesh Raman, Bal Sri Shankar:
Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem. 265-273 - Prasun Kumar, Jayalal Sarma, Saurabh Sawlani:
On Directed Tree Realizations of Degree Sets. 274-285 - Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT Algorithm for Tree Deletion Set. 286-297
Graph Drawing
- Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Circular Graph Drawings with Large Crossing Angles. 298-309 - Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman:
On Graphs That Are Not PCGs. 310-321 - Indhumathi Raman:
On Embedding of Certain Recursive Trees and Stars into Hypercube. 322-333 - Md. Manzurul Hasan, Md. Saidur Rahman, Muhammad Rezaul Karim:
Box-Rectangular Drawings of Planar Graphs. 334-345
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-05-01 23:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
