History


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

Result 1 to 20 of 63 total

Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes. (English)
Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16‒18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 111-118 (2013).
WorldCat.org
1
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. (English)
Theor. Comput. Sci. 513, 65-76 (2013).
WorldCat.org
2
A linear-time algorithm for testing outer-1-planarity. (English)
Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23‒25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 71-82 (2013).
WorldCat.org
3
A formal derivation of composite trust. (English)
Garcia-Alfaro, Joaquin (ed.) et al., Foundations and practice of security. 5th international symposium, FPS 2012, Montreal, QC, Canada, October 25‒26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-37118-9/pbk). Lecture Notes in Computer Science 7743, 132-148 (2013).
WorldCat.org
4
Quantitative questions on attack-defense trees. (English)
Kwon, Taekyoung (ed.) et al., Information security and cryptology ‒ ICISC 2012. 15th international conference, Seoul, Korea, November 28‒30, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-37681-8/pbk). Lecture Notes in Computer Science 7839, 49-64 (2013).
WorldCat.org
5
Testing maximal 1-planarity of graphs with a rotation system in linear time. (Extended abstract). (English)
Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19‒21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 339-345 (2013).
WorldCat.org
6
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink. (English)
IEEE Trans. ComputersIEEE Trans. Computers 62, N0. 10, 1932-1944(2013)
WorldCat.org
7
Iterated open neighborhood graphs and generalizations. (English)
Discrete Applied MathematicsDiscrete Applied Mathematics 161, N0. 10-11, 1598-1609(2013)
WorldCat.org
8
Proper parallel Monte Carlo for computed tomography of volcanoes. (English)
HPCS, 519-526(2013)
WorldCat.org
9
ADTool: Security Analysis with Attack-Defense Trees. (English)
QEST, 173-176(2013)
WorldCat.org
10
On Beta Models with Trust Chains. (English)
IFIPTM, 49-65(2013)
WorldCat.org
11
Online graph exploration: New results on old and new algorithms. (English)
Theor. Comput. Sci. 463, 62-72 (2012).
WorldCat.org
12
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 34-45 (2012).
WorldCat.org
13
Computational aspects of attack-defense trees. (English)
Bouvry, Pascal (ed.) et al., Security and intelligent information systems. International joint conferences, SIIS 2011, Warsaw, Poland, June 13‒14, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25260-0/pbk). Lecture Notes in Computer Science 7053, 103-116 (2012).
WorldCat.org
14
Infeasible code detection. (English)
Joshi, Rajeev (ed.) et al., Verified software: Theories, tools, experiments. 4th international conference, VSTTE 2012, Philadelphia, PA, USA, January 28‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27704-7/pbk). Lecture Notes in Computer Science 7152, 310-325 (2012).
WorldCat.org
15
The Hummingbird-2 lightweight authenticated encryption algorithm. (English)
Juels, Ari (ed.) et al., RFID. Security and privacy. 7th international workshop, RFIDSec 2011, Amherst, USA, June 26‒28, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25285-3/pbk). Lecture Notes in Computer Science 7055, 19-31 (2012).
WorldCat.org
16
Attribute Decoration of Attack-Defense Trees. (English)
IJSSEIJSSE 3, N0. 2, 1-35(2012)
WorldCat.org
17
Weisfeiler-Lehman graph kernels. (English)
J. Mach. Learn. Res. 12, 2539-2561 (2011).
WorldCat.org
18
Isomorphism of (mis)labeled graphs. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 370-381 (2011).
WorldCat.org
19
Online graph exploration: new results on old and new algorithms. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 478-489 (2011).
WorldCat.org
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 63 total

Valid XHTML 1.0 Transitional Valid CSS!