Tools

LEADER 05816cam 22005897a 4500

001 ssj0000746083;

003 WaSeSS;

005 20240412080346.0;

006 m d ;

007 cr n ;

008 120806s2012 xx s 000 0 eng d;

010 a| 2012946191;

020 a| 9783642332920 (pkb. : alk. paper);

020 a| 3642332927 (pkb. : alk. paper);

035 a| (WaSeSS)ssj0000746083;

042 a| lccopycat;

049 a| EREEa| NEHH;

050 00 a| QA276.8b| .I64 2012;

082 04 a| 519.5/442| 23;

111 2 a| IPEC (Symposium)n| (7th :d| 2012 :c| Ljubljana, Slovenia)?| UNAUTHORIZED;

245 10 a| Parameterized and exact computationh| [electronic resource] :b| 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings /c| Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.).;

246 3 a| IPEC 2012;

260 a| Berlin ;a| New York :b| Springer,;

300 a| x, 273 p. :b| ill. ;c| 24 cm.;

490 1 a| Lecture notes in computer science,x| 0302-9743 ;v| 7535;

490 1 a| LNCS sublibrary. SL 1, Theoretical computer science and general issues;

500 a| International conference proceedings.;

500 a| Includes author index.;

505 00 t| The Path Taken for k-Path /r| Andreas Björklund --t| Randomized Techniques for Parameterized Algorithms /r| Dániel Marx --t| Finding a Maximum Induced Degenerate Subgraph Faster Than 2n /r| Marcin Pilipczuk and Michał Pilipczuk --t| The Exponential Time Hypothesis and the Parameterized Clique Problem /r| Yijia Chen, Kord Eickmeyer and Jörg Flum --t| New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set /r| Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao --t| A New Algorithm for Parameterized MAX-SAT /r| Ivan Bliznets and Alexander Golovnev --t| Restricted and Swap Common Superstring: A Parameterized View /r| Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis --t| Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging /r| Łukasz Kowalik --t| Some Definitorial Suggestions for Parameterized Proof Complexity /r| Jörg Flum and Moritz Müller --t| An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs /r| Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei --t| Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? /r| Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk --t| A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs /r| Cédric Bentz --;

505 00 t| Instance Compression for the Polynomial Hierarchy and beyond /r| Chiranjit Chakraborty and Rahul Santhanam --t| Polynomial Time and Parameterized Approximation Algorithms for Boxicity /r| Abhijin Adiga, Jasine Babu and L. Sunil Chandran --t| Homomorphic Hashing for Sparse Coefficient Extraction /r| Petteri Kaski, Mikko Koivisto and Jesper Nederlof --t| Fast Monotone Summation over Disjoint Sets /r| Petteri Kaski, Mikko Koivisto and Janne H. Korhonen --t| Weighted Counting of k-Matchings Is #W[1]-Hard /r| Markus Bläser and Radu Curticapean --t| Computing Directed Pathwidth in O(1.89n) Time /r| Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano --t| MSOL Restricted Contractibility to Planar Graphs /r| James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil --t| On the Space Complexity of Parameterized Problems /r| Michael Elberfeld, Christoph Stockhusen and Till Tantau --t| On Tractable Parameterizations of Graph Isomorphism /r| Adam Bouland, Anuj Dawar and Eryk Kopczyński --t| Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs /r| Sepp Hartung, Christian Komusiewicz and André Nichterlein --t| Finding Dense Subgraphs of Sparse Graphs /r| Christian Komusiewicz and Manuel Sorge --t| Enumerating Neighbour and Closest Strings /r| Naomi Nishimura and Narges Simjour --t| An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem /r| Faisal N. Abu-Khzam and Mazen Bou Khuzam.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Parameter estimationv| Congresses.=| ^A126733;

650 0 a| Computer algorithmsv| Congresses.=| ^A417202;

655 0 a| Electronic books.=| ^A491897;

700 1 a| Thilikos, Dimitrios M.?| UNAUTHORIZED;

700 1 a| Woeginger, Gerhard.=| ^A397928;

830 0 a| Lecture notes in computer science ;v| 7535.=| ^A466336;

830 0 a| LNCS sublibrary.n| SL 1,p| Theoretical computer science and general issues.=| ^A1368241;

856 40 z| Full text available from Springer Booksu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F978-3-642-33293-7;

856 40 z| Full text available from Springer Nature - Springer Computer Science eBooks 2012 English Internationalu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F978-3-642-33293-7;

856 40 z| Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present)u| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2Fopenurl%3Fgenre%3Dbook%26isbn%3D978-3-642-33292-0;

947 a| (OCoLC)ocn806020817;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 4219361;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4219361-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 1/2/2016x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4219361-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 1/2/2016x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4219361-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 1/2/2016x| EBOOKz| JERESOURCE;

Parameterized and exact computation 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.).

Author/creator	IPEC (Symposium)
Other author	Thilikos, Dimitrios M.
Other author	Woeginger, Gerhard.
Format	Electronic
Publication Info	Berlin ; New York : Springer,
Description	x, 273 p. : ill. ; 24 cm.
Supplemental Content	Full text available from Springer Books
Supplemental Content	Full text available from Springer Nature - Springer Computer Science eBooks 2012 English International
Supplemental Content	Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present)
Subjects	Parameter estimation--Congresses. Computer algorithms--Congresses.

Variant title	IPEC 2012
Series	Lecture notes in computer science, 0302-9743 ; 7535 LNCS sublibrary. SL 1, Theoretical computer science and general issues Lecture notes in computer science ; 7535. ^A466336 LNCS sublibrary. SL 1, Theoretical computer science and general issues. ^A1368241
Contents	The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dá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 Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérô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 / Jörg Flum and Moritz Mü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 / Cédric Bentz --
Contents	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 Blä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 Klavík, Jan Kratochvíl and Tomáš Vyskoč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 Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André 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.
General note	International conference proceedings.
General note	Includes author index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2012946191
ISBN	9783642332920 (pkb. : alk. paper)
ISBN	3642332927 (pkb. : alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Online Content Full text available from Springer Books Full text available from Springer Books Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present)	✔ Available

Parameterized and exact computation 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.).

Click here for more information about this title

Availability