- Home
- Publications
- Publication Search
- Publication Details
Title
Solving problems on generalized convex graphs via mim-width
Authors
Keywords
-
Journal
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Volume -, Issue -, Pages 103493
Publisher
Elsevier BV
Online
2023-11-07
DOI
10.1016/j.jcss.2023.103493
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Thinness of product graphs
- (2021) Flavia Bonomo-Braberman et al. DISCRETE APPLIED MATHEMATICS
- On H-Topological Intersection Graphs
- (2021) Steven Chaplick et al. ALGORITHMICA
- Bounding the mim‐width of hereditary graph classes
- (2021) Nick Brettell et al. JOURNAL OF GRAPH THEORY
- List k-colouring P-free graphs: A Mim-width perspective
- (2021) Nick Brettell et al. INFORMATION PROCESSING LETTERS
- Maximum weight induced matching in some subclasses of bipartite graphs
- (2020) B. S. Panda et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Graph functionality
- (2020) Bogdan Alecu et al. JOURNAL OF COMBINATORIAL THEORY SERIES B
- Mim-Width II. The Feedback Vertex Set Problem
- (2019) Lars Jaffke et al. ALGORITHMICA
- Domination in some subclasses of bipartite graphs
- (2018) Arti Pandey et al. DISCRETE APPLIED MATHEMATICS
- On the thinness and proper thinness of a graph
- (2018) Flavia Bonomo et al. DISCRETE APPLIED MATHEMATICS
- A width parameter useful for chordal and co-comparability graphs
- (2017) Dong Yeap Kang et al. THEORETICAL COMPUTER SCIENCE
- Hardness of computing width parameters based on branch decompositions over the vertex set
- (2016) Sigve Hortemo Sæther et al. THEORETICAL COMPUTER SCIENCE
- Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
- (2015) Shenwei Huang et al. COMPUTER JOURNAL
- Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs
- (2015) Hao Chen et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
- (2015) Jiehua Chen et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Tractable connected domination for restricted bipartite graphs
- (2014) Tian Liu et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Circular convex bipartite graphs: Feedback vertex sets
- (2014) Tian Liu et al. THEORETICAL COMPUTER SCIENCE
- List Coloring in the Absence of a Linear Forest
- (2013) Jean-François Couturier et al. ALGORITHMICA
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- (2013) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- Graph classes with structured neighborhoods and algorithmic applications
- (2013) Rémy Belmonte et al. THEORETICAL COMPUTER SCIENCE
- Feedback vertex sets on restricted bipartite graphs
- (2012) Wei Jiang et al. THEORETICAL COMPUTER SCIENCE
- Boolean-width of graphs
- (2011) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- (2011) Flavia Bonomo et al. THEORETICAL COMPUTER SCIENCE
- Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
- (2008) Chính T. Hoàng et al. ALGORITHMICA
- Recent developments on graphs of bounded clique-width
- (2008) Marcin Kamiński et al. DISCRETE APPLIED MATHEMATICS
- Clique-width of graphs defined by one-vertex extensions
- (2008) Michaël Rao DISCRETE MATHEMATICS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now