|
Showing 1 - 3 of
3 matches in All Departments
This volume contains the papers presented at the 11th Algorithms
and Data Structures Symposium, WADS 2009 (formerly Workshop on
Algorithms and Data Structures), held during August 21-23, 2009 in
Ban?, Alberta, Canada. WADS alternates with the Scandinavian
Workshop on Algorithms Theory (SWAT), continuing the tradition of
SWAT and WADS starting with SWAT 1988 and WADS 1989.
Inresponsetothecallforpapers,126papersweresubmitted. Fromtheses-
missions, the ProgramCommittee selected 49 papers for presentation
at WADS 2009. In addition, invited lectures were given by the
following distinguished researchers: Erik Demaine, Richard Karp,
and Christos Papadimitriou. On behalf of the Program Committee, we
would like to express our appre- ation to the invited speakers,
reviewers and all authors who submitted papers. May 2009 Frank
Dehne Marina Gavrilova J.. org-Ru ..diger Sack Csaba D. T' oth
Conference Organization Program Chairs Frank Dehne Marina Gavrilova
Joerg-Ruediger Sack Csaba D. Toth Program Committee Sergei Bereg
Allan Borodin Gerth Stolting Brodal Timothy Chan Mark de Berg Frank
Devai Matt Duckham Rolf Fagerberg Randolph Franklin Joachim
Gudmundsson Susanne Hambrusch Rolf Klein Mike Langston Ming Li
Friedhelm Meyer auf der Heide Ian Munro Jon Rokne Shashi Shekhar
Bettina Speckmann Paul Spirakis Gabor Tardos Je? Vitter Frances F.
Yao Local Organization Marina Gavrilova Csaba D. Toth Jon Rokne
Maruf Monwar Kushan Ahmadian Table of Contents On the Power of the
Semi-Separated Pair Decomposition...1 Mohammad Ali Abam, Paz Carmi,
Mohammad Farshi, and Michiel Smid Plane Graphs with Parity
Constraints...
|
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Paperback, 1st ed. 2019)
Daniel Archambault, Csaba D. Toth
|
R1,398
R1,326
Discovery Miles 13 260
Save R72 (5%)
|
Ships in 9 - 15 working days
|
This book constitutes the refereed proceedings of the 27th
International Symposium on Graph Drawing and Network Visualization,
GD 2019, held in Prague, Czech Republic, in September 2019.The 42
papers and 12 posters presented in this volume were carefully
reviewed and selected from 113 submissions. They were organized
into the following topical sections: Cartograms and Intersection
Graphs, Geometric Graph Theory, Clustering, Quality Metrics,
Arrangements, A Low Number of Crossings, Best Paper in Track 1,
Morphing and Planarity, Parameterized Complexity, Collinearities,
Topological Graph Theory, Best Paper in Track 2, Level Planarity,
Graph Drawing Contest Report, and Poster Abstracts.
The Handbook of Discrete and Computational Geometry is intended as
a reference book fully accessible to nonspecialists as well as
specialists, covering all major aspects of both fields. The book
offers the most important results and methods in discrete and
computational geometry to those who use them in their work, both in
the academic world-as researchers in mathematics and computer
science-and in the professional world-as practitioners in fields as
diverse as operations research, molecular biology, and robotics.
Discrete geometry has contributed significantly to the growth of
discrete mathematics in recent years. This has been fueled partly
by the advent of powerful computers and by the recent explosion of
activity in the relatively young field of computational geometry.
This synthesis between discrete and computational geometry lies at
the heart of this Handbook. A growing list of application fields
includes combinatorial optimization, computer-aided design,
computer graphics, crystallography, data analysis, error-correcting
codes, geographic information systems, motion planning, operations
research, pattern recognition, robotics, solid modeling, and
tomography.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|