"New Parameterized Algorithms for the Edge Dominating Set Problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Parameterized Algorithms	Marek Cygan; Fedor V. Fomin; Łukasz Kowalik; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michał Pilipczuk; Saket Saurabh	1st ed. 2015	Springer International Publishing
Connected Dominating Set: Theory and Applications	Ding-Zhu Du; Peng-Jun Wan	2013	Springer New York
Creating and Dominating New Markets	Peter Meyer	February 2002	AMACOM/American Management Association
Online Algorithms for the Portfolio Selection Problem	Robert Dochow	1st ed. 2016	Springer Fachmedien Wiesbaden
Faster algorithms for the shortest path problem		1988	Sloan School of Management, Massachusetts Institute of Technology
Set on edge.	Bernice Rubens	1972	Vallentine, Mitchell
Set on Edge	Bernice Rubens	April 6, 1989	Abacus
Dominating the Enemy	Anthony Saunders	November 10, 2000	Alan Sutton Publishing
Bio-inspired Algorithms for the Vehicle Routing Problem	Francisco Baptista Pereira; Jorge Tavares	2009	Springer Berlin Heidelberg
Domain decomposition algorithms for the biharmonic Dirichlet problem.	Xuejun Zhang	1991	Courant Institute of Mathematical Sciences, New York University
Parameterized Complexity	Rodney G. Downey; M.R. Fellows	1999	Springer New York
Additional Problem Set	Bedford; FOWLER	June 29, 2000	Addison Wesley
The Winning Edge: Tips for Creative Problem-Solving Teams	Richard Safris	November 1995	Good Apple Inc
Some modified algorithms for Dijkstra's longest upsequence problem.	Robert B. K. Dewar	1980	Courant Institute of Mathematical Sciences, New York University
Parameterized Complexity Theory	J. Flum; M. Grohe	2006	Springer Berlin Heidelberg
New Algorithms for Macromolecular Simulation	Peter J. Bond, Jonathan Cuthbertson, Sundeep S. Deol, Lucy R. Forrest (auth.), Benedict Leimkuhler, Christophe Chipot, Ron Elber, Aatto Laaksonen, Alan Mark, Tamar Schlick, Christoph Schütte, Robert Skeel (eds.)	2006	Springer-Verlag Berlin Heidelberg
New Algorithms for Macromolecular Simulation	Benedict Leimkuhler; Christophe Chipot; Ron Elber; Aatto Laaksonen; Alan Mark; Tamar Schlick; Christoph Schütte;	2006	Springer Berlin Heidelberg
Swarm Intelligence Algorithms (Two Volume Set)	Adam Slowik	2020	Routledge
The Quadratic Assignment Problem: Theory and Algorithms	E. Cela	1998	Springer US
The stable marriage problem: structure and algorithms	Dan Gusfield	1989	MIT Press
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
New Parameterized Algorithms for the Edge Dominating Set Problem	Mingyu Xiao; Ton Kloks; Sheung-Hung Poon	Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings	Filip Murlak; Piotr Sankowski	2011	Springer Berlin Heidelberg
An Improved Algorithm for Parameterized Edge Dominating Set Problem	Ken Iwaide; Hiroshi Nagamochi	WALCOM: Algorithms and Computation: 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings	M. Sohel Rahman; Etsuji Tomita	2015	Springer International Publishing
Improved Parameterized Algorithms for Planar Dominating Set	Iyad A. Kanj; Ljubomir Perković	Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings	Krzysztof Diks; Wojciech Rytter	2002	Springer Berlin Heidelberg
Parameterized Edge Dominating Set in Cubic Graphs	Mingyu Xiao; Hiroshi Nagamochi	Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings	Mikhail Atallah; Xiang-Yang Li; Binhai Zhu	2011	Springer Berlin Heidelberg
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs	Mingyu Xiao	Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II	Weili Wu; Ovidiu Daescu	2010	Springer Berlin Heidelberg
Parameterized Algorithms for the Happy Set Problem	Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru	WALCOM: Algorithms and Computation: 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings	M. Sohel Rahman; Kunihiko Sadakane; Wing-Kin Sung	1st ed. 2020	Springer International Publishing
Exact (Exponential) Algorithms for the Dominating Set Problem	Fedor V. Fomin; Dieter Kratsch; Gerhard J. Woeginger	Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers	Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel	2005	Springer Berlin Heidelberg
Exact Algorithms for Dominating Set	Dieter Kratsch	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Exact Algorithms for Dominating Set	Dieter Kratsch	Encyclopedia of Algorithms	Ming-Yang Kao	0th ed. 2020	Springer Berlin Heidelberg
Linear Time Algorithms for Generalized Edge Dominating Set Problems	André Berger; Ojas Parekh	Algorithms and Data Structures: 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings	Frank Dehne; Alejandro López-Ortiz; Jörg-Rüdiger Sack	2005	Springer Berlin Heidelberg
nonblocker: Parameterized Algorithmics for minimum dominating set	Frank Dehne; Michael Fellows; Henning Fernau; Elena Prieto; Frances Rosamond	SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings	Jirí Wiedermann; Gerard Tel; Jaroslav Pokorný; Mária Bieliková; Július Štuller	2006	Springer Berlin Heidelberg
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems	Takuro Fukunaga; Hiroshi Nagamochi	Computing and Combinatorics: 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings	Lusheng Wang	2005	Springer Berlin Heidelberg
Randomized Parameterized Algorithms for Co-path Set Problem	Qilong Feng; Qian Zhou; Shaohua Li	Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings	Jianer Chen; John E. Hopcroft; Jianxin Wang	2014	Springer International Publishing
edge dominating set: Efficient Enumeration-Based Exact Algorithms	Henning Fernau	Parameterized and Exact Computation: Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings	Hans L. Bodlaender; Michael A. Langston	2006	Springer Berlin Heidelberg
Mixed Dominating Set: A Parameterized Perspective	Pallavi Jain; M. Jayakrishnan; Fahad Panolan; Abhishek Sahu	Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers	Hans L. Bodlaender; Gerhard J. Woeginger	1st ed. 2017	Springer International Publishing
Algorithms for Minimum m-Connected k-Dominating Set Problem	Weiping Shang; Frances Yao; Pengjun Wan; Xiaodong Hu	Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi' an, China, August 14-16, 2007, Proceedings	Andreas Dress; Yinfeng Xu; Binhai Zhu	2007	Springer Berlin Heidelberg
Fast algorithms for the dominating set problem on permutation graphs	Kuo-Hui Tsai; Wen-Lian Hsu	Algorithms: International Symposium SIGAL ' 90, Tokyo, Japan, August 16-18, 1990. Proceedings	Tetsuo Asano; Toshihide Ibaraki; Hiroshi Imai; Takao Nishizeki	1990	Springer Berlin Heidelberg
The Prize-Collecting Edge Dominating Set Problem in Trees	Naoyuki Kamiyama	Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings	Petr Hlineny; Antonin Kucera	2010	Springer Berlin Heidelberg
Parameterized Approximation Algorithms for Hitting Set	Ljiljana Brankovic; Henning Fernau	Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers	Roberto Solis-Oba; Giuseppe Persiano	2012	Springer Berlin Heidelberg
Parameterized Algorithms for Feedback Vertex Set	Iyad Kanj; Michael Pelsmajer; Marcus Schaefer	Parameterized and Exact Computation: First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings	Frank Dehne; Rod Downey; Michael Fellows	2004	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"New Parameterized Algorithms for the Edge Dominating Set Problem" - similar Books and Chapters