Result 1 to 20 of 28 total
Parameterized complexity of the spanning tree congestion problem. (English)
Algorithmica 64, No. 1, 85-111 (2012).
1
Subgraph isomorphism in graph classes. (English)
Discrete Math. 312, No. 21, 3164-3173 (2012).
2
Efficient algorithms for network localization using cores of underlying graphs. (English)
Erlebach, Thomas (ed.) et al., Algorithms for sensor systems. 7th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28208-9/pbk). Lecture Notes in Computer Science 7111, 101-114 (2012).
3
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. (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, 24-35 (2012).
4
Efficient enumeration of ordered trees with $k$ leaves. (English)
Theor. Comput. Sci. 442, 22-27 (2012).
5
Random generation and enumeration of bipartite permutation graphs. (English)
J. Discrete Algorithms 10, 84-97 (2012).
6
Spanning tree congestion of rook’s graphs. (English)
Discuss. Math., Graph Theory 31, No. 4, 753-761 (2011).
7
Designing low-congestion networks with structural graph theory. (English)
Interdiscip. Inf. Sci. 17, No. 3, 197-216 (2011).
8
Approximability of the path-distance-width for AT-free graphs. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 271-282 (2011).
9
Hardness results and an exact exponential algorithm for the spanning tree congestion problem. (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 452-462 (2011).
10
Bandwidth and pathwidth of three-dimensional grids. (English)
Comput. Res. Repos. 2011, Article No. 1101.0964 (2011).
11
Spanning tree congestion of $k$-outerplanar graphs. (English)
Discrete Math. 311, No. 12, 1040-1045 (2011).
12
Bandwidth and pathwidth of three-dimensional grids. (English)
Discrete Math. 311, No. 10-11, 881-887 (2011).
13
Spanning tree congestion of rook’s graphs (English)
Discussiones Mathematicae Graph Theory 31, No. 4, 753-761 (2011).
14
Approximability of the path-distance-width for AT-free graphs (English)
WG, 271-282 (2011).
15
Hardness results and an exact exponential algorithm for the spanning tree congestion problem (English)
TAMC, 452-462 (2011).
16
Complexity results for the spanning tree congestion problem. (English)
Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28‒30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 3-14 (2010).
17
The carving-width of generalized hypercubes. (English)
Discrete Math. 310, No. 21, 2867-2876 (2010).
18
Complexity results for the spanning tree congestion problem (English)
WG, 3-14 (2010).
19
Security number of grid-like graphs. (English)
Discrete Appl. Math. 157, No. 11, 2555-2561 (2009).
20
Result 1 to 20 of 28 total
Start
Contact
Print
General Help
