Integer Programming and Combinatorial Optimization [[electronic resource] ] : 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings / / edited by Oktay Günlük, Gerhard J. Woeginger |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XIII, 432 p. 30 illus., 3 illus. in color.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Artificial intelligence—Data processing Numerical analysis Computer networks Discrete Mathematics in Computer Science Computer Graphics Data Science Numerical Analysis Computer Communication Networks |
ISBN | 3-642-20807-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465336003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parameterized and Exact Computation [[electronic resource] ] : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / / edited by Dimitrios M. Thilikos, Gerhard J. Woeginger |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (X, 275 p. 14 illus.) |
Disciplina | 519.5/44 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
ISBN | 3-642-33293-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dániel Marx -- Finding a Maximum Induced Degenerate Subgraph Faster Than 2n / Marcin Pilipczuk and Michał Pilipczuk -- The Exponential Time Hypothesis and the Parameterized Clique Problem / Yijia Chen, Kord Eickmeyer and Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao -- A New Algorithm for Parameterized MAX-SAT / Ivan Bliznets and Alexander Golovnev -- Restricted and Swap Common Superstring: A Parameterized View / Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis -- Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging / Łukasz Kowalik -- Some Definitorial Suggestions for Parameterized Proof Complexity / Jörg Flum and Moritz Müller -- An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei -- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? / Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk -- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs / Cédric Bentz --
Instance Compression for the Polynomial Hierarchy and beyond / Chiranjit Chakraborty and Rahul Santhanam -- Polynomial Time and Parameterized Approximation Algorithms for Boxicity / Abhijin Adiga, Jasine Babu and L. Sunil Chandran -- Homomorphic Hashing for Sparse Coefficient Extraction / Petteri Kaski, Mikko Koivisto and Jesper Nederlof -- Fast Monotone Summation over Disjoint Sets / Petteri Kaski, Mikko Koivisto and Janne H. Korhonen -- Weighted Counting of k-Matchings Is #W[1]-Hard / Markus Bläser and Radu Curticapean -- Computing Directed Pathwidth in O(1.89n) Time / Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano -- MSOL Restricted Contractibility to Planar Graphs / James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil -- On the Space Complexity of Parameterized Problems / Michael Elberfeld, Christoph Stockhusen and Till Tantau -- On Tractable Parameterizations of Graph Isomorphism / Adam Bouland, Anuj Dawar and Eryk Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André Nichterlein -- Finding Dense Subgraphs of Sparse Graphs / Christian Komusiewicz and Manuel Sorge -- Enumerating Neighbour and Closest Strings / Naomi Nishimura and Narges Simjour -- An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem / Faisal N. Abu-Khzam and Mazen Bou Khuzam. |
Record Nr. | UNISA-996466048303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|