Result 1 to 20 of 254 total
Exploiting a hypergraph model for finding golomb rulers. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 368-379 (2012).
1
New races in parameterized algorithmics. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 19-30 (2012).
2
Studies in computational aspects of voting. A parameterized complexity perspective. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 318-363 (2012).
3
Partitioning into colorful components by minimum edge deletions. (English)
Kärkkäinen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 56-69 (2012).
4
Confluence in data reduction: Bridging graph transformation and kernelization. (English)
Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 193-202 (2012).
5
Linear-time computation of a linear problem kernel for dominating set on planar graphs. (English)
Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 194-206 (2012).
6
On making directed graphs transitive. (English)
J. Comput. Syst. Sci. 78, No. 2, 559-574 (2012).
7
Approximation and tidying ‒ a problem kernel for $s$-plex cluster vertex deletion. (English)
Algorithmica 62, No. 3-4, 930-950 (2012).
8
On bounded-degree vertex deletion parameterized by treewidth. (English)
Discrete Appl. Math. 160, No. 1-2, 53-60 (2012).
9
Graph-based data clustering with overlaps. (English)
Discrete Optim. 8, No. 1, 2-17 (2011).
10
Aspects of a multivariate complexity analysis for rectangle tiling. (English)
Oper. Res. Lett. 39, No. 5, 346-351 (2011).
11
A new view on rural postman based on Eulerian extension and matching. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 310-323 (2011).
12
A generalization of Nemhauser and Trotter’s local optimization theorem. (English)
J. Comput. Syst. Sci. 77, No. 6, 1141-1158 (2011).
13
From few components to an Eulerian graph by adding ARCS. (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, 307-318 (2011).
14
The parameterized complexity of local search for TSP, more refined. (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, 614-623 (2011).
15
Parameterized complexity of arc-weighted directed Steiner problems. (English)
SIAM J. Discrete Math. 25, No. 2, 583-599 (2011).
16
The effect of homogeneity on the complexity of $k$-anonymity. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 53-64 (2011).
17
Pattern-guided data anonymization and clustering. (English)
Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 182-193 (2011).
18
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 104-115 (2011).
19
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring. (English)
J. Discrete Algorithms 9, No. 1, 137-151 (2011).
20
Result 1 to 20 of 254 total
Start
Contact
Print
General Help
