History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 138 total

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. (English)
MFCS, 33:1-33:14(2016)
WorldCat.org
1
Drawing partially embedded and simultaneously planar graphs. (English)
J. Graph Algorithms Appl. 19, No. 2, 681-706 (2015).
WorldCat.org
2
Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems. (English)
Bansal, Nikhil (ed.) et al., Algorithms ‒ ESA 2015. 23rd annual European symposium, Patras, Greece, September 14‒16, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48349-7/pbk; 978-3-662-48350-3/ebook). Lecture Notes in Computer Science 9294, 288-299 (2015).
WorldCat.org
3
On maximum common subgraph problems in series-parallel graphs. (English)
Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15‒17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 200-212 (2015).
WorldCat.org
4
Enumeration of maximum common subtree isomorphisms with polynomial-delay. (English)
Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15‒17, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13074-3/pbk; 978-3-319-13075-0/ebook). Lecture Notes in Computer Science 8889, 81-93 (2014).
WorldCat.org
5
Practical SAHN clustering for very large data sets and expensive distance metrics. (English)
J. Graph Algorithms Appl. 18, No. 4, 577-602 (2014).
WorldCat.org
6
Drawing partially embedded and simultaneously planar graphs. (English)
Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24‒26, 2014. Revised selected papers. Berlin: Springer (ISBN 978-3-662-45802-0/pbk). Lecture Notes in Computer Science 8871, 25-39 (2014).
WorldCat.org
7
Finding maximum common biconnected subgraphs in series-parallel graphs. (English)
Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25‒29, 2014. Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-44464-1/pbk). Lecture Notes in Computer Science 8635, 505-516 (2014).
WorldCat.org
8
SAHN clustering in arbitrary metric spaces using heuristic nearest neighbor search. (English)
Pal, Sudebkumar Prasant (ed.) et al., Algorithms and computation. 8th international workshop, WALCOM 2014, Chennai, India, February 13‒15, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-04656-3/pbk). Lecture Notes in Computer Science 8344, 90-101 (2014).
WorldCat.org
9
Examining the Compactness of Automatically Generated Layouts for Practical Diagrams. (English)
ED/GViP@Diagrams, 42-52(2014)
WorldCat.org
10
Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. (English)
ICDM, 881-886(2014)
WorldCat.org
11
Practical Experience with Hanani-Tutte for Testing c-Planarity. (English)
ALENEX, 86-97(2014)
WorldCat.org
12
Parameterized algorithms for stochastic Steiner tree problems. (English)
Kučera, Antonín (ed.) et al., Mathematical and engineering methods in computer science. 8th international doctoral workshop, MEMICS 2012, Znojmo, Czech Republic, October 25‒28, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36044-2/pbk). Lecture Notes in Computer Science 7721, 143-154 (2013).
WorldCat.org
13
The maximum weight connected subgraph problem. (English)
Jünger, Michael (ed.) et al., Facets of combinatorial optimization. Festschrift for Martin Grötschel on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-38188-1/hbk; 978-3-642-38189-8/ebook). 245-270 (2013).
WorldCat.org
14
The rooted maximum node-weight connected subgraph problem. (English)
Gomes, Carla (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 10th international conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18‒22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38170-6/pbk). Lecture Notes in Computer Science 7874, 300-315 (2013).
WorldCat.org
15
The Open Graph Drawing Framework (OGDF). (English)
Handbook of Graph Drawing and Visualization, 543-569(2013)
WorldCat.org
16
Crossings and Planarization. (English)
Handbook of Graph Drawing and Visualization, 43-85(2013)
WorldCat.org
17
Algorithm Engineering im Graphenzeichnen. (English)
Informatik Spektrum 36, N0. 2, 162-173(2013)
WorldCat.org
18
MolMap - Visualizing Molecule Libraries as Topographic Maps. (English)
GRAPP/IVAPP, 515-524(2013)
WorldCat.org
19
Stochastic Survivable Network Design Problems. (English)
Electronic Notes in Discrete Mathematics 41, 245-252(2013)
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 138 total

Valid XHTML 1.0 Transitional Valid CSS!