On Structural Parameterizations of Firefighting (English)
- New search for: Das, Bireswar
- New search for: Enduri, Murali Krishna
- New search for: Misra, Neeldhara
- New search for: Reddy, I. Vinod
- New search for: Panda, B.S.
- New search for: Goswami, Partha P.
- New search for: Das, Bireswar
- New search for: Enduri, Murali Krishna
- New search for: Misra, Neeldhara
- New search for: Reddy, I. Vinod
In:
Algorithms and Discrete Applied Mathematics
: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings
;
Chapter: 19
;
221-234
;
2018
- Article/Chapter (Book) / Electronic Resource
-
Title:On Structural Parameterizations of Firefighting
-
Additional title:Lect.Notes Computer
-
Contributors:Panda, B.S. ( editor ) / Goswami, Partha P. ( editor ) / Das, Bireswar ( author ) / Enduri, Murali Krishna ( author ) / Misra, Neeldhara ( author ) / Reddy, I. Vinod ( author )
-
Conference:Conference on Algorithms and Discrete Applied Mathematics ; 2018 ; Guwahati, India
-
Published in:Algorithms and Discrete Applied Mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings ; Chapter: 19 ; 221-234Lecture Notes in Computer Science ; 10743 ; 221-234
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2018-01-16
-
Size:14 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Efficient Domination and Efficient Edge Domination: A Brief SurveyBrandstädt, Andreas et al. | 2018
- 2
-
Mixed Unit Interval BigraphsDas, Ashok Kumar / Sahu, Rajkamal et al. | 2018
- 3
-
Hamiltonian Path in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{1,t}$$\end{document}-free Split Graphs- A DichotomyRenjith, Pazhaniappan / Sadagopan, Narasimhan et al. | 2018
- 4
-
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint SystemsCaskurlu, Bugra / Williamson, Matthew / Subramani, K. / Mkrtchyan, Vahan / Wojciechowski, Piotr et al. | 2018
- 5
-
Probabilistic Properties of Highly Connected Random Geometric GraphsManthey, Bodo / Reijnders, Victor M. J. J. et al. | 2018
- 6
-
On Indicated Coloring of Some Classes of GraphsFrancis, P. / Francis Raj, S. / Gokulnath, M. et al. | 2018
- 7
-
Line Segment Disk CoverBasappa, Manjanna et al. | 2018
- 8
-
Fixed-Parameter Tractable Algorithms for Tracking Set ProblemsBanik, Aritra / Choudhary, Pratibha et al. | 2018
- 9
-
Exact Computation of the Number of Accepting Paths of an NTMKalyanasundaram, Subrahmanyam / Regan, Kenneth W. et al. | 2018
- 10
-
Determining Minimal Degree Polynomials of a Cyclic Code of Length \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^k$$\end{document} over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}_8$$\end{document}Garg, Arpana / Dutt, Sucheta et al. | 2018
- 11
-
Consistent Subset Problem with Two LabelsKhodamoradi, Kamyar / Krishnamurti, Ramesh / Roy, Bodhayan et al. | 2018
- 12
-
The Edge Geodetic Number of Product GraphsAnand, Bijo S. / Changat, Manoj / Ullas Chandran, S. V. et al. | 2018
- 13
-
Burning SpidersDas, Sandip / Dev, Subhadeep Ranjan / Sadhukhan, Arpan / Sahoo, Uma kant / Sen, Sagnik et al. | 2018
- 14
-
Drawing Graphs on Few Circles and Few SpheresKryven, Myroslav / Ravsky, Alexander / Wolff, Alexander et al. | 2018
- 15
-
On a Lower Bound for the Eccentric Connectivity Index of GraphsBantva, Devsi et al. | 2018
- 16
-
On the Tractability of (k, i)-ColoringJoshi, Saurabh / Kalyanasundaram, Subrahmanyam / Kare, Anjeneya Swami / Bhyravarapu, Sriram et al. | 2018
- 17
-
Window Queries for Problems on Intersecting Objects and Maximal Points*Chanchary, Farah / Maheshwari, Anil / Smid, Michiel et al. | 2018
- 18
-
Bounded Stub Resolution for Some Maximal 1-Planar GraphsKaufmann, Michael / Kratochvíl, Jan / Lipp, Fabian / Montecchiani, Fabrizio / Raftopoulou, Chrysanthi / Valtr, Pavel et al. | 2018
- 19
-
On Structural Parameterizations of FirefightingDas, Bireswar / Enduri, Murali Krishna / Misra, Neeldhara / Reddy, I. Vinod et al. | 2018
- 20
-
On the Simultaneous Minimum Spanning Trees ProblemKonečný, Matěj / Kučera, Stanislav / Novotná, Jana / Pekárek, Jakub / Smolík, Martin / Tětek, Jakub / Töpfer, Martin et al. | 2018
- 21
-
Variations of Cops and Robbers Game on GridsDas, Sandip / Gahlawat, Harmender et al. | 2018
- 22
-
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential GapsDinesh, Krishnamoorthy / Sarma, Jayalal et al. | 2018
- 23
-
On Oriented L(p, 1)-labelingDas, Sandip / Nandi, Soumen / Sen, Sagnik et al. | 2018
- 24
-
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance FunctionsDas, Sandip / Nandy, Ayan / Sarvottamananda, Swami et al. | 2018