Result 1 to 20 of 589 total
The shortcut problem - complexity and algorithms. (English)
J. Graph Algorithms Appl. 16, No. 2, 447-481 (2012).
1
Dynamic graph clustering using minimum-cut trees. (English)
J. Graph Algorithms Appl. 16, No. 2, 411-446 (2012).
2
A knowledge-based model of parliamentary election. (English)
Inf. Sci. 202, 24-40 (2012).
3
On the complexity of partitioning graphs for arc-flags. (English)
Delling, Daniel (ed.) et al., 12th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’12, September 13, 2012, Ljubljana, Slovenia. Selected papers based on the presentations at the workshop. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-45-3). OASIcs ‒ OpenAccess Series in Informatics 25, 71-82, electronic only (2012).
4
On the complexity of partitioning graphs for arc-flags. (English)
Simões, Alberto (ed.) et al., 1st symposium on languages, applications and technologies, SLATE’12, June 21‒22, 2012, Braga, Portugal. Proceedings. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-40-8). OASIcs ‒ OpenAccess Series in Informatics 21, 71-82, electronic only (2012).
5
Higher order city Voronoi diagrams. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 59-70 (2012).
6
Generalizing geometric graphs. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 179-190 (2012).
7
Tweakable block ciphers. (English)
J. Cryptology 24, No. 3, 588-613 (2011).
8
Proof of the monotone column permanent conjecture. (English)
Brändén, Petter (ed.) et al., Notions of positivity and the geometry of polynomials. Dedicated to the memory of Julius Borcea. Basel: Birkhäuser (ISBN 978-3-0348-0141-6/hbk; 978-3-0348-0142-3/ebook). Trends in Mathematics, 63-78 (2011).
9
Algorithm engineering for route planning: an update. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 1-5 (2011).
10
The density maximization problem in graphs. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 25-36 (2011).
11
Density-constrained graph clustering. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 679-690 (2011).
12
Fully-dynamic hierarchical graph clustering using cut trees. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 338-349 (2011).
13
Chromatic roots of a ring of four cliques. (English)
Electron. J. Comb. 18, No. 1, Research Paper P151, 13 p., electronic only (2011).
14
Computing large matchings in planar graphs with fixed minimum degree. (English)
Theor. Comput. Sci. 412, No. 32, 4092-4099 (2011).
15
Generating time dependencies in road networks. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 434-446 (2011).
16
Efficient algorithms for distributed detection of holes and boundaries in wireless networks. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 388-399 (2011).
17
Speed dating. An algorithmic case study involving matching and scheduling. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 292-303 (2011).
18
An experimental study on generating planar graphs. (English)
Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 375-387 (2011).
19
Efficient algorithms for distributed detection of holes and boundaries in wireless networks. (English)
Comput. Res. Repos. 2011, Article No. 1103.1771 (2011).
20
Result 1 to 20 of 589 total
Start
Contact
Print
General Help
