N. R. Aravind

Neeldhara Misra

Harshil Mittal

Theor. Comput. Sci., 2024

The Parameterized Complexity of Terminal Monitoring Set.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Perfectly matched sets in graphs: Parameterized and exact computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Line-Constrained k-Semi-Obnoxious Facility Location.

[BibT_eX]

[DOI]

Vishwanath R. Singireddy

Manjanna Basappa

CoRR, 2023

Parameterized Complexity of Path Set Packing.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Planar projections of graphs.

[BibT_eX]

[DOI]

Udit Maniyar

Discret. Appl. Math., 2022

Vertex partitioning problems on graphs with bounded tree width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Intersection dimension and graph invariants.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

An FPT algorithm for Matching Cut.

[BibT_eX]

[DOI]

CoRR, 2021

Structure and Colour in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Wouter Cames van Batenburg

Stijn Cambie

Rémi de Joannis de Verclos

Ross J. Kang

Viresh Patel

Electron. J. Comb., 2021

An FPT Algorithm for Matching Cut and d-Cut.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Parameterized complexity of happy coloring problems.

[BibT_eX]

[DOI]

Akanksha Agrawal

Theor. Comput. Sci., 2020

2019

H-Free Coloring on Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Bipartitioning Problems on Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Dichotomy Results on the Hardness of H-free Edge Modification Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Algorithms and hardness results for happy coloring problems.

[BibT_eX]

[DOI]

Juho Lauri

CoRR, 2017

On Polynomial Kernelization of H-free Edge Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2017

On Structural Parameterizations of the Matching Cut Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

On the expressive power of read-once determinants.

[BibT_eX]

[DOI]

Pushkar S. Joglekar

Electron. Colloquium Comput. Complex., 2015

The chromatic discrepancy of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion.

[BibT_eX]

[DOI]

CoRR, 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Forbidden subgraph colorings and the oriented chromatic number.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

2011

Bounds on vertex colorings with restrictions on the union of color classes.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Oriented colouring of some graph products.

[BibT_eX]

[DOI]

N. Narayanan

Discuss. Math. Graph Theory, 2011

Bounding χ in terms of ω and Δ for some classes of graphs.

[BibT_eX]

[DOI]

T. Karthick

Discret. Math., 2011

2010

Bounds on Edge Colorings with Restrictions on the Union of Color Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2009

Intersection Dimension and Maximum Degree.

[BibT_eX]

[DOI]