Induced Matchings in Asteroidal Triple-free Graphs
Jou-Ming Chang
Discrete Applied Mathematics, Vol. 132, (2003) pp. 67-78.
The above article has been cited by the articles listed below.
Kathie Cameron, R. Sritharan, Yingwen Tang,
Finding a maximum induced matching in weakly chordal graphs
,
Discrete Mathematics
266 (2003) 133-142.
Kathie Cameron,
Connected matchings
,
Lecture Notes in Computer Science
2570 (2003) 34-38.
Kathie Cameron,
Induced matchings in intersection graphs
,
Discrete Mathematics
278 (2004) 1-9.
(*)
William Duckworth, David F. Manlove, Michele Zito,
On the approximability of the maximum induced matching problem
,
Journal of Discrete Algorithms
3 (2005) 79-91.
(*)
Kathie Cameron, Tracy Walker,
The graphs with maximum induced matching and maximum matching the same size
,
Discrete Mathematics
299 (2005) 49-55.
(*)
Kathie Cameron, Pavol Hell,
Independent packings in structured graphs
,
Mathematical Programming Ser. B
105 (2006) 201-213.
(*)
Andreas Brandstädt, Elaine M. Eschen and R. Sritharan,
The induced matching and chain subgraph cover problems for convex bipartite graphs
,
Theoretical Computer Science
381 (2007) 260-265.
(*)
Andreas Brandstädt, Chính T. Hoàng,
Maximum induced matchings for chordal graphs in linear time
,
Algorithmica
52 (2008) 440-447.
(*)
Yury Orlovich, Gerd Finke, Valery Gordon, Igor Zverovich,
Approximability results for the maximum and minimum maximal induced matching problems
,
Discrete Optimization
5 (2008) 584-593.
(*)
Jaroslav Nešetřil, Patrice Ossona de Mendez,
Structural properties of sparse graphs
,
In: Building Bridges - Between Mathematics and Computer Sciencer (2008) pp. 369-426.
(*)
Kathie Cameron,
Brambles and independent packings in chordal graphs
,
Discrete Mathematics
309 (2009) 5766-5769.
(*)
Jaroslav Nešetřil, Patrice Ossona de Mendez,
Induced matchings and induced paths in graphs
,
Unpublished manuscript.
Andreas Brandstädt, Raffaele Mosca,
On distance-3 matchings and induced matchings
,
Conference on Graph Theory, Computational Intelligence and Thought,
Lecture Notes in Computer Science
5420 (2009) 116-126.
(*)
Atif Abueida, Arthur H. Busch, R. Sritharan,
A min-max property of chordal bipartite graphs with applications
,
Graphs and Combinatorics
26 (2010) 301-313.
Pavol Hell, Arash Rafiey,
The dichotomy of list homomorphisms for digraphs
,
22nd Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 2011), San Francisco, CA, 23-25 Jan. 2011, pp. 1703-1713.
(*)
Andreas Brandstädt, Raffaele Mosca,
On distance-3 matchings and induced matchings
,
Discrete Applied Mathematics
159 (2011) 509-520.
(*)
Domingos M. Cardoso, Nicholas Korpelainen, Vadim V. Lozin,
On the complexity of the dominating induced matching problem in hereditary classes of graphs
,
Discrete Applied Mathematics
159 (2011) 521-531.
(*)
Yury Orlovich, Alexandre Dolgui, Gerd Finke, Valery Gordon, Frank Werner,
The complexity of dissociation set problems in graphs
,
Discrete Applied Mathematics
159 (2011) 1352-1366.
(*)
Chandra Mohan Krishnamurthy, R. Sritharan,
Maximum induced matching problem on HHD-free graphs
,
Discrete Applied Mathematics
160 (2012) 224-230.
(*)
Vadim V. Lozin, Raffaele Mosca,
Maximum regular induced subgraphs in 2P3-free graphs
,
Theoretical Computer Science
460 (2012) 26-33.
(*)
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach,
Efficient dominating and edge dominating sets for graphs and hypergraphss
,
23rd International Symposium on Algorithms and Computation
(ISAAC 2012),
Lecture Notes in Computer Science
7676 (2012) 267-277.
(*)
Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin,
New results on maximum induced matchings in bipartite graphs and beyond
,
Theoretical Computer Science
478 (2013) 33-40.
(*)
Marc Demange, Tinaz Ekim,
A note on the NP-hardness of two matching problems in induced subgrids
,
Discrete Mathematics and Theoretical Computer Science
15:2 (2013) 233-242.
(*)
Nicholas Korpelainen,
Boundary properties of graphs
, PhD thesis, University of Warwick.
Fedor Fomin, Ioan Todinca, Yngve Villanger,
Large induced subgraphs via triangulations and CMSO
,
arXiv preprint arXiv:1309.1559, 2013.
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno,
Dominating sets and induced matchings in orthogonal ray graphs
,
IEICE Transaction on Information and Systems
E97-D (2014) 3101-3109.
(*)
Fedor V. Fomin, Ioan Todincay, Yngve Villanger,
Large induced subgraphs via triangulations and CMSO
,
25th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 2014), Illinois, USA, 2014, pp. 582-593.
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno,
Weighted dominating sets and induced matchings in orthogonal ray graphs
,
2014 International Conference on Control, Decision and Information Technologies
(CoDIT 2014), Metz, France, 3-5 Nov. 2014, pp. 69-73.
(*)
Fedor V. Fomin, Ioan Todincay, Yngve Villanger,
Large induced subgraphs via triangulations and CMSO
,
SIAM Journal of Computing
44 (2015) 54-87.
(*)
Felix Joos, Dieter Rautenbach,
Equality of distance packing numbers
,
Discrete Mathematics
338 (2015) 2374-2377.
(*)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung,
Moderately exponential time algorithms for the maximum induced matching problem
,
Optimization Letters
9 (2015) 981-998.
(*)
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang,
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
,
Journal of Discrete Algorithms
30 (2015) 21-28.
(*)
Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu,
On orthogonal ray trees
,
Discrete Applied Mathematics
201 (2016) 201-212.
(*)
Felix Joos, Viet Hang Nguyen,
Induced matchings in graphs of degree at most 4
,
SIAM Journal of Discrete Mathematics
30 (2016) 154-165.
(*)
Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich,
Graphs with maximal induced matchings of the same size
,
Discrete Applied Mathematics
216 (2017) 15-28.
(*)
Michel Habib, Lalla Mouatadid,
Maximum induced matching algorithms via vertex ordering characterizations
,
28th International Symposium on Algorithms and Computations
(ISAAC 2017), Phuket, Thailand, Dec. 9-12, 2017, Article No. 43.
Andreas Brandstädt,
Efficient domination and efficient edge domination: A brief survey
,
Proceedings of 4th International Conference on Algorithms and Discrete Applied Mathematics
(CALDAM 2018), Guwahati, India, Feb. 12-17, 2018,
Lecture Notes in Computer Science
Vol. 10743, pp. 1-14.
(*)
Min Chih Lin, Julian Mestre, Saveliy Vasiliev,
Approximating weighted induced matchings
,
Discrete Applied Mathematics
243 (2017) 304-310.
(*)
Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic,
The induced separation dimension of a graph
,
Algorithmica
80 (2018) 2834-2848.
(*)
Viet-Dung Nguyen, Ba-Thai Pham, Viet-Hung Tran, Phan-Thuan Do,
A dynamic programming algorithm for the maximum induced matching problem in permutation graphs
,
Proceedings of the Ninth International Symposium on Information and Communication Technology
(SoICT 2018), Danang City, Vietnam, Dec. 6-7, 2018, pp. 92-97.
(*)
Viet-Hung Tran, Duc-Nghia Nguyen, Phan-Thuan Do,
Linear time algorithm for maximum distance-k matching in interval graphs
,
Proceedings of 2018 5th NAFOSTED Conference on Information and Computer Science
(NICS 2018), Ho Chi Minh City, Vietnam, Nov. 23-24, 2018, pp. 41-46.
(*)
Viet Cuong Than, Phan Thuan Do,
An O (n root(n) log log n) average case algorithm for the maximum induced matching problem in permutation graphs
,
Proceedings of the 5th Asian Conference on Defence Technology
(ACDT 2018), Hanoi, Vietnam, Oct. 25-26, 2018, pp. 45-49.
(*)
Michel Habib, Lalla Mouatadid,
Maximum induced matching algorithms via vertex ordering characterizations
,
Algorithmica
82 (2020) 260-278.
(*)
Kecai Deng, Gexin Yu, Xiangqian Zhou,
Recent progress on strong edge-coloring of graph
,
Discrete Mathematics Algorithms And Applications
11(5) (2019) 1950062.
(*)
Phan Thuan Do, Ba Thai Pham, Viet Cuong Than,
Latest algorithms on particular graph classes
,
Olympiads in Informatics
14 (2020) 21-35.
Cuong Than,
Separator of Diametral Path Graphs
, MS Thesis. University of Nebraska-Lincoln, 2021. May 2021.
Viet Dung Nguyen, Ba Thai Pham, Phan Thuan Do,
Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs
,
Fundamenta Informaticae
182(3) (2021) 257-283.
(*)
Boris Klemz, Günter Rote
Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
,
Algorithmica
84(4) (2022) 1064-1080.
(*)
Milanic, Martin; Uno, Yushi,
Upper clique transversals in graphs
,
49the International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2023),
Lecture Notes in Computer Science
14093 (2023) 432-446.
(*)
Times cited:
39
(from Web of Science)