| Description |
1 online resource |
| Series |
Lecture notes in computer science, 0302-9743 ; 7748 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7748.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Invited Talks -- Mobility and Computations: Some Open Research Directions / Nicola Santoro -- Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries / Rina Panigrahy -- Computational Geometry -- A Novel Efficient Approach for Solving the Art Gallery Problem / Alexander Kröller, Mahdi Moeini, Christiane Schmidt -- Fixed-Orientation Equilateral Triangle Matching of Point Sets / Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel Smid -- Online Exploration and Triangulation in Orthogonal Polygonal Regions / Sándor P. Fekete, Sophia Rex, Christiane Schmidt -- A Competitive Strategy for Distance-Aware Online Shape Allocation / Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt -- Base Location Problems for Base-Monotone Regions / Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono -- Counting Maximal Points in a Query Orthogonal Rectangle / Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan |
|
Voronoi Game on Graphs / Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar -- Approximation and Randomized Algorithms -- Approximation Schemes for Covering and Packing / Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky -- A Randomised Approximation Algorithm for the Hitting Set Problem / Mourad El Ouali, Helena Fohlin, Anand Srivastav -- Exact and Approximation Algorithms for Densest k-Subgraph / Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis -- Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs / Christophe Crespelle, Philippe Gambette -- Approximation Algorithms for the Partition Vertex Cover Problem / Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy -- Parallel and Distributed Computing -- Daemon Conversions in Distributed Self-stabilizing Algorithms / Wayne Goddard, Pradip K. Srimani |
|
Broadcasting in Conflict-Aware Multi-channel Networks / Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Paweł Prałat -- Shared-Memory Parallel Frontier-Based Search / Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato -- Graph Algorithms -- Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching / Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin -- Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs / Jiawei Gao, Ton Kloks, Sheung-Hung Poon -- Alliances and Bisection Width for Planar Graphs / Martin Olsen, Morten Revsbæk -- The Cyclical Scheduling Problem / Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti -- Complexity and Bounds -- Generalized Rainbow Connectivity of Graphs / Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou |
|
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems / Peter Damaschke, Ömer Eğecioğlu, Leonid Molokov -- Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs / Tapas Kumar Mishra, Sudebkumar Prasant Pal -- Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem / Venkatesh Raman, Bal Sri Shankar -- On Directed Tree Realizations of Degree Sets / Prasun Kumar, M.N. Jayalal Sarma, Saurabh Sawlani -- An FPT Algorithm for Tree Deletion Set / Venkatesh Raman, Saket Saurabh, Ondřej Suchý -- Graph Drawing -- Circular Graph Drawings with Large Crossing Angles / Hooman Reisi Dehkordi, Quan Nguyen, Peter Eades, Seok-Hee Hong -- On Graphs That Are Not PCGs / Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman -- On Embedding of Certain Recursive Trees and Stars into Hypercube / Indhumathi Raman -- Box-Rectangular Drawings of Planar Graphs / Md. Manzurul Hasan, Md. Saidur Rahman, Md. Rezaul Karim |
| Summary |
This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing |
| Analysis |
Computer science |
|
Computer software |
|
Computational complexity |
|
Algebra -- Data processing |
|
Discrete Mathematics in Computer Science |
|
Math Applications in Computer Science |
|
Symbolic and Algebraic Manipulation |
|
computerwetenschappen |
|
computer sciences |
|
wiskunde |
|
mathematics |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
algebra |
|
computergrafie |
|
computer graphics |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references |
| Notes |
English |
| Subject |
Computer algorithms -- Congresses
|
|
Algorithms
|
|
algorithms.
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Software.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Ghosh, Subir Kumar.
|
|
Tokuyama, Takeshi.
|
| ISBN |
9783642360657 |
|
3642360653 |
|
3642360645 |
|
9783642360640 |
|
