Spiro, Sam; Adriaensen, Sam; Mattheus, Sam Incidence-free sets and edge domination in incidence graphs. (English) Zbl 07809555 J. Comb. Des. 32, No. 2, 55-87 (2024). MSC: 05B05 05C70 PDFBibTeX XMLCite \textit{S. Spiro} et al., J. Comb. Des. 32, No. 2, 55--87 (2024; Zbl 07809555) Full Text: DOI arXiv OA License
Henning, Michael A.; Pandey, Arti; Sharma, Gopika; Tripathi, Vikash Algorithms and hardness results for edge total domination problem in graphs. (English) Zbl 07809108 Theor. Comput. Sci. 982, Article ID 114270, 15 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. A. Henning} et al., Theor. Comput. Sci. 982, Article ID 114270, 15 p. (2024; Zbl 07809108) Full Text: DOI
Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung On the \(d\)-claw vertex deletion problem. (English) Zbl 07795033 Algorithmica 86, No. 2, 505-525 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S.-Y. Hsieh} et al., Algorithmica 86, No. 2, 505--525 (2024; Zbl 07795033) Full Text: DOI
Tavakoli, Mostofa; Došlić, Tomislav Smallest maximal matchings of graphs. (English) Zbl 1524.05244 Hacet. J. Math. Stat. 52, No. 2, 356-366 (2023). MSC: 05C70 05C69 05C76 PDFBibTeX XMLCite \textit{M. Tavakoli} and \textit{T. Došlić}, Hacet. J. Math. Stat. 52, No. 2, 356--366 (2023; Zbl 1524.05244) Full Text: DOI
Fujito, Toshihiro A note on approximations of directed edge dominating set. (English) Zbl 07609048 Inf. Process. Lett. 179, Article ID 106303, 4 p. (2023). MSC: 68R10 05C69 68W25 PDFBibTeX XMLCite \textit{T. Fujito}, Inf. Process. Lett. 179, Article ID 106303, 4 p. (2023; Zbl 07609048) Full Text: DOI
Panda, B. S.; Sachin Hardness and approximation results for some variants of stable marriage problem. (English) Zbl 07683177 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 252-264 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. S. Panda} and \textit{Sachin}, Lect. Notes Comput. Sci. 13179, 252--264 (2022; Zbl 07683177) Full Text: DOI
Cames van Batenburg, Wouter Minimum maximal matchings in cubic graphs. (English) Zbl 1497.05213 Electron. J. Comb. 29, No. 2, Research Paper P2.36, 20 p. (2022). MSC: 05C70 05C69 68W25 PDFBibTeX XMLCite \textit{W. Cames van Batenburg}, Electron. J. Comb. 29, No. 2, Research Paper P2.36, 20 p. (2022; Zbl 1497.05213) Full Text: DOI arXiv
Anderson, Sarah E.; Kuenzel, Kirsti; Rall, Douglas F. On well-edge-dominated graphs. (English) Zbl 1496.05121 Graphs Comb. 38, No. 4, Paper No. 106, 14 p. (2022); correction ibid. 38, No. 5, Paper No. 165, 1 p. (2022). Reviewer: Doost Ali Mojdeh (Babolsar) MSC: 05C69 05C76 05C75 PDFBibTeX XMLCite \textit{S. E. Anderson} et al., Graphs Comb. 38, No. 4, Paper No. 106, 14 p. (2022; Zbl 1496.05121) Full Text: DOI arXiv
Hsieh, Sun-Yuan; Le, Van Bang; Peng, Sheng-Lung On the \(d\)-claw vertex deletion problem. (English) Zbl 07670495 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 591-603 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{S.-Y. Hsieh} et al., Lect. Notes Comput. Sci. 13025, 591--603 (2021; Zbl 07670495) Full Text: DOI arXiv
Fujito, Toshihiro; Tatematsu, Takumi On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem. (English) Zbl 07603885 Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 65-79 (2021). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{T. Fujito} and \textit{T. Tatematsu}, Lect. Notes Comput. Sci. 12982, 65--79 (2021; Zbl 07603885) Full Text: DOI
Monnot, Jérôme; Fernau, Henning; Manlove, David Algorithmic aspects of upper edge domination. (English) Zbl 1516.68070 Theor. Comput. Sci. 877, 46-57 (2021). MSC: 68R10 05C69 68Q17 68W25 PDFBibTeX XMLCite \textit{J. Monnot} et al., Theor. Comput. Sci. 877, 46--57 (2021; Zbl 1516.68070) Full Text: DOI
Lamprou, Ioannis; Sigalas, Ioannis; Zissimopoulos, Vassilis Improved budgeted connected domination and budgeted edge-vertex domination. (English) Zbl 1462.68241 Theor. Comput. Sci. 858, 1-12 (2021). Reviewer: Vladimír Lacko (Košice) MSC: 68W25 05C69 05C85 68W40 PDFBibTeX XMLCite \textit{I. Lamprou} et al., Theor. Comput. Sci. 858, 1--12 (2021; Zbl 1462.68241) Full Text: DOI arXiv
Baste, Julien; Fürst, Maximilian; Henning, Michael A.; Mohr, Elena; Rautenbach, Dieter Bounding and approximating minimum maximal matchings in regular graphs. (English) Zbl 1458.90537 Discrete Math. 344, No. 3, Article ID 112243, 8 p. (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Baste} et al., Discrete Math. 344, No. 3, Article ID 112243, 8 p. (2021; Zbl 1458.90537) Full Text: DOI arXiv
Lamprou, Ioannis; Sigalas, Ioannis; Zissimopoulos, Vassilis Improved budgeted connected domination and budgeted edge-vertex domination. (English) Zbl 07601021 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 368-381 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{I. Lamprou} et al., Lect. Notes Comput. Sci. 12126, 368--381 (2020; Zbl 07601021) Full Text: DOI
Pan, Zhuo; Li, Xianyue; Xu, Shou-Jun Complexity and characterization aspects of edge-related domination for graphs. (English) Zbl 1472.05121 J. Comb. Optim. 40, No. 3, 757-773 (2020). Reviewer: Seyed Mahmood Sheikholeslami (Tabriz) MSC: 05C69 05C35 68Q25 05C05 PDFBibTeX XMLCite \textit{Z. Pan} et al., J. Comb. Optim. 40, No. 3, 757--773 (2020; Zbl 1472.05121) Full Text: DOI
Pan, Zhuo; Yang, Yu; Li, Xianyue; Xu, Shou-Jun The complexity of total edge domination and some related results on trees. (English) Zbl 1466.05170 J. Comb. Optim. 40, No. 3, 571-589 (2020). MSC: 05C69 68Q17 05C05 PDFBibTeX XMLCite \textit{Z. Pan} et al., J. Comb. Optim. 40, No. 3, 571--589 (2020; Zbl 1466.05170) Full Text: DOI arXiv
Baste, Julien; Fürst, Maximilian; Henning, Michael A.; Mohr, Elena; Rautenbach, Dieter Domination versus edge domination. (English) Zbl 1466.05155 Discrete Appl. Math. 285, 343-349 (2020). Reviewer: Thanin Sitthiwirattham (Bangkok) MSC: 05C69 05C07 05C30 05C35 PDFBibTeX XMLCite \textit{J. Baste} et al., Discrete Appl. Math. 285, 343--349 (2020; Zbl 1466.05155) Full Text: DOI arXiv
do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Veronica A.; Szwarcfiter, Jayme L. Modelling and solving the perfect edge domination problem. (English) Zbl 1442.90193 Optim. Lett. 14, No. 2, 369-394 (2020). MSC: 90C35 PDFBibTeX XMLCite \textit{V. L. do Forte} et al., Optim. Lett. 14, No. 2, 369--394 (2020; Zbl 1442.90193) Full Text: DOI Link
Bazgan, Cristina; Fernau, Henning; Tuza, Zsolt Aspects of upper defensive alliances. (English) Zbl 1476.05149 Discrete Appl. Math. 266, 111-120 (2019). MSC: 05C69 05C07 68Q17 68Q25 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Discrete Appl. Math. 266, 111--120 (2019; Zbl 1476.05149) Full Text: DOI Link
Bandyapadhyay, Sayan; Maheshwari, Anil; Mehrabi, Saeed; Suri, Subhash Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames. (English) Zbl 1425.05108 Comput. Geom. 82, 32-44 (2019). MSC: 05C69 05C35 05C62 68Q17 68Q25 68U05 68W25 PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Comput. Geom. 82, 32--44 (2019; Zbl 1425.05108) Full Text: DOI
Zhu, Enqiang; Liu, Chanjuan On the semitotal domination number of line graphs. (English) Zbl 1404.05161 Discrete Appl. Math. 254, 295-298 (2019). MSC: 05C69 05C76 68Q17 PDFBibTeX XMLCite \textit{E. Zhu} and \textit{C. Liu}, Discrete Appl. Math. 254, 295--298 (2019; Zbl 1404.05161) Full Text: DOI
Da Lozzo, Giordano; Rutter, Ignaz Approximation algorithms for facial cycles in planar embeddings. (English) Zbl 07561395 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 41, 13 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{G. Da Lozzo} and \textit{I. Rutter}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 41, 13 p. (2018; Zbl 07561395) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Kim, Eun Jung; Lampis, Michael New results on directed edge dominating set. (English) Zbl 1512.68191 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018). MSC: 68R10 05C20 05C69 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018; Zbl 1512.68191) Full Text: DOI arXiv
Bandyapadhyay, Sayan; Maheshwari, Anil; Mehrabi, Saeed; Suri, Subhash Approximating dominating set on intersection graphs of rectangles and L-frames. (English) Zbl 1512.68400 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 37, 15 p. (2018). MSC: 68U05 05C62 05C69 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 37, 15 p. (2018; Zbl 1512.68400) Full Text: DOI arXiv
Adil, Deeksha; Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Parameterized algorithms for stable matching with ties and incomplete lists. (English) Zbl 1392.68196 Theor. Comput. Sci. 723, 1-10 (2018). MSC: 68Q25 91B68 PDFBibTeX XMLCite \textit{D. Adil} et al., Theor. Comput. Sci. 723, 1--10 (2018; Zbl 1392.68196) Full Text: DOI
Lee, Chuan-Min On the complexity of variations of mixed domination on graphs. (English) Zbl 1355.05238 Int. J. Comput. Math. 93, No. 11, 1937-1963 (2016). MSC: 05C85 68Q17 90C27 PDFBibTeX XMLCite \textit{C.-M. Lee}, Int. J. Comput. Math. 93, No. 11, 1937--1963 (2016; Zbl 1355.05238) Full Text: DOI
Tural, Mustafa Kemal Maximal matching polytope in trees. (English) Zbl 1342.90099 Optim. Methods Softw. 31, No. 3, 471-478 (2016). MSC: 90C05 90C10 90C57 05C05 05C70 PDFBibTeX XMLCite \textit{M. K. Tural}, Optim. Methods Softw. 31, No. 3, 471--478 (2016; Zbl 1342.90099) Full Text: DOI
Fujito, Toshihiro; Suzuki, Daichi Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers. (English) Zbl 1475.68242 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 251-262 (2016). MSC: 68R10 05C69 05C70 68W15 68W25 PDFBibTeX XMLCite \textit{T. Fujito} and \textit{D. Suzuki}, Lect. Notes Comput. Sci. 9627, 251--262 (2016; Zbl 1475.68242) Full Text: DOI
Raju, S. V. Siva Rama; Rao, I. H. Nagaraja Complementary nil vertex edge dominating sets. (English) Zbl 1345.05074 Proyecciones 34, No. 1, 1-14 (2015). Reviewer: Nasrin Dehgardi (Sirjan) MSC: 05C69 PDFBibTeX XMLCite \textit{S. V. S. R. Raju} and \textit{I. H. N. Rao}, Proyecciones 34, No. 1, 1--14 (2015; Zbl 1345.05074) Full Text: DOI
Saban, Daniela; Sethuraman, Jay The complexity of computing the random priority allocation matrix. (English) Zbl 1409.91187 Math. Oper. Res. 40, No. 4, 1005-1014 (2015). MSC: 91B68 68Q17 PDFBibTeX XMLCite \textit{D. Saban} and \textit{J. Sethuraman}, Math. Oper. Res. 40, No. 4, 1005--1014 (2015; Zbl 1409.91187) Full Text: DOI
Zhao, Yancai; Liao, Zuhua; Miao, Lianying On the algorithmic complexity of edge total domination. (English) Zbl 1338.68123 Theor. Comput. Sci. 557, 28-33 (2014). MSC: 68Q25 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{Y. Zhao} et al., Theor. Comput. Sci. 557, 28--33 (2014; Zbl 1338.68123) Full Text: DOI
Demange, Marc; Ekim, Tınaz; Tanasescu, Cerasela Hardness and approximation of minimum maximal matchings. (English) Zbl 1305.05188 Int. J. Comput. Math. 91, No. 8, 1635-1654 (2014). MSC: 05C70 05C35 05C85 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{M. Demange} et al., Int. J. Comput. Math. 91, No. 8, 1635--1654 (2014; Zbl 1305.05188) Full Text: DOI
Song, Wenyao; Miao, Lianying; Wang, Haichao; Zhao, Yancai Maximal matching and edge domination in complete multipartite graphs. (English) Zbl 1302.05135 Int. J. Comput. Math. 91, No. 5, 857-862 (2014). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{W. Song} et al., Int. J. Comput. Math. 91, No. 5, 857--862 (2014; Zbl 1302.05135) Full Text: DOI
Bodur, Merve; Ekim, Tinaz; Taşkın, Z. Caner Decomposition algorithms for solving the minimum weight maximal matching problem. (English) Zbl 1338.05212 Networks 62, No. 4, 273-287 (2013). MSC: 05C70 90C10 PDFBibTeX XMLCite \textit{M. Bodur} et al., Networks 62, No. 4, 273--287 (2013; Zbl 1338.05212) Full Text: DOI
Taşkın, Z. Caner; Ekim, Tınaz Integer programming formulations for the minimum weighted maximal matching problem. (English) Zbl 1254.90130 Optim. Lett. 6, No. 6, 1161-1171 (2012). MSC: 90C11 90C35 91B68 PDFBibTeX XMLCite \textit{Z. C. Taşkın} and \textit{T. Ekim}, Optim. Lett. 6, No. 6, 1161--1171 (2012; Zbl 1254.90130) Full Text: DOI
Farzad, Babak; Lau, Lap Chi; Le, Van Bang; Tuy, Nguyen Ngoc Complexity of finding graph roots with girth conditions. (English) Zbl 1239.05127 Algorithmica 62, No. 1-2, 38-53 (2012). MSC: 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{B. Farzad} et al., Algorithmica 62, No. 1--2, 38--53 (2012; Zbl 1239.05127) Full Text: DOI Link
Schmied, Richard; Viehmann, Claus Approximating edge dominating set in dense graphs. (English) Zbl 1235.68079 Theor. Comput. Sci. 414, No. 1, 92-99 (2012). MSC: 68Q17 05C85 68W25 PDFBibTeX XMLCite \textit{R. Schmied} and \textit{C. Viehmann}, Theor. Comput. Sci. 414, No. 1, 92--99 (2012; Zbl 1235.68079) Full Text: DOI
Liang, Zuosong; Shan, Erfang Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. (English) Zbl 1260.68157 Inf. Process. Lett. 111, No. 23-24, 1104-1107 (2011). MSC: 68Q17 05C85 05C69 68R10 68W25 PDFBibTeX XMLCite \textit{Z. Liang} and \textit{E. Shan}, Inf. Process. Lett. 111, No. 23--24, 1104--1107 (2011; Zbl 1260.68157) Full Text: DOI
Matsumoto, Yusuke; Kamiyama, Naoyuki; Imai, Keiko An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. (English) Zbl 1260.68467 Inf. Process. Lett. 111, No. 10, 465-468 (2011). MSC: 68W25 68R10 05C15 05C70 PDFBibTeX XMLCite \textit{Y. Matsumoto} et al., Inf. Process. Lett. 111, No. 10, 465--468 (2011; Zbl 1260.68467) Full Text: DOI
Assiyatun, H.; Duckworth, W. Small maximal matchings of random cubic graphs. (English) Zbl 1190.05094 J. Graph Theory 62, No. 4, 293-323 (2009). MSC: 05C80 05C70 05C85 PDFBibTeX XMLCite \textit{H. Assiyatun} and \textit{W. Duckworth}, J. Graph Theory 62, No. 4, 293--323 (2009; Zbl 1190.05094) Full Text: DOI
Cardinal, Jean; Langerman, Stefan; Levy, Eythan Improved approximation bounds for edge dominating set in dense graphs. (English) Zbl 1165.68055 Theor. Comput. Sci. 410, No. 8-10, 949-957 (2009). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{J. Cardinal} et al., Theor. Comput. Sci. 410, No. 8--10, 949--957 (2009; Zbl 1165.68055) Full Text: DOI
Gotthilf, Zvi; Lewenstein, Moshe; Rainshmidt, Elad A \((2 - c \frac{\log {n}}{n})\) approximation algorithm for the minimum maximal matching problem. (English) Zbl 1209.68640 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 267-278 (2009). MSC: 68W25 05C70 05C85 PDFBibTeX XMLCite \textit{Z. Gotthilf} et al., Lect. Notes Comput. Sci. 5426, 267--278 (2009; Zbl 1209.68640) Full Text: DOI
Irving, Robert W.; Manlove, David F.; Scott, Sandy The stable marriage problem with master preference lists. (English) Zbl 1175.05111 Discrete Appl. Math. 156, No. 15, 2959-2977 (2008). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{R. W. Irving} et al., Discrete Appl. Math. 156, No. 15, 2959--2977 (2008; Zbl 1175.05111) Full Text: DOI
Parekh, Ojas Approximation algorithms for partially covering with edges. (English) Zbl 1145.68052 Theor. Comput. Sci. 400, No. 1-3, 159-168 (2008). MSC: 68W25 05C70 05C85 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{O. Parekh}, Theor. Comput. Sci. 400, No. 1--3, 159--168 (2008; Zbl 1145.68052) Full Text: DOI
Demange, M.; Ekim, T. Minimum maximal matching is NP-hard in regular bipartite graphs. (English) Zbl 1139.05337 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 364-374 (2008). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{M. Demange} and \textit{T. Ekim}, Lect. Notes Comput. Sci. 4978, 364--374 (2008; Zbl 1139.05337) Full Text: DOI
Berger, André; Parekh, Ojas Linear time algorithms for generalized edge dominating set problems. (English) Zbl 1141.68058 Algorithmica 50, No. 2, 244-254 (2008); erratum ibid. 62, No. 1-2, 633-634 (2012). MSC: 68W25 05C69 05C85 PDFBibTeX XMLCite \textit{A. Berger} and \textit{O. Parekh}, Algorithmica 50, No. 2, 244--254 (2008; Zbl 1141.68058) Full Text: DOI
Fukunaga, Takuro; Nagamochi, Hiroshi Generalizing the induced matching by edge capacity constraints. (English) Zbl 1163.90606 Discrete Optim. 4, No. 2, 198-205 (2007). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{T. Fukunaga} and \textit{H. Nagamochi}, Discrete Optim. 4, No. 2, 198--205 (2007; Zbl 1163.90606) Full Text: DOI
Berger, André; Fukunaga, Takuro; Nagamochi, Hiroshi; Parekh, Ojas Approximability of the capacitated \(b\)-edge dominating set problem. (English) Zbl 1124.68115 Theor. Comput. Sci. 385, No. 1-3, 202-213 (2007). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{A. Berger} et al., Theor. Comput. Sci. 385, No. 1--3, 202--213 (2007; Zbl 1124.68115) Full Text: DOI
Chlebík, Miroslav; Chlebíková, Janka Approximation hardness of edge dominating set problems. (English) Zbl 1255.90121 J. Comb. Optim. 11, No. 3, 279-290 (2006). MSC: 90C35 05C69 90C60 PDFBibTeX XMLCite \textit{M. Chlebík} and \textit{J. Chlebíková}, J. Comb. Optim. 11, No. 3, 279--290 (2006; Zbl 1255.90121) Full Text: DOI Link
Halldórsson, Magnús M.; Irving, Robert W.; Iwama, Kazuo; Manlove, David F.; Miyazaki, Shuichi; Morita, Yasufumi; Scott, Sandy Approximability results for stable marriage problems with ties. (English) Zbl 1060.68085 Theor. Comput. Sci. 306, No. 1-3, 431-447 (2003). MSC: 68R10 68W05 68W25 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Theor. Comput. Sci. 306, No. 1--3, 431--447 (2003; Zbl 1060.68085) Full Text: DOI
Manlove, David F.; Irving, Robert W.; Iwama, Kazuo; Miyazaki, Shuichi; Morita, Yasufumi Hard variants of stable marriage. (English) Zbl 1050.68171 Theor. Comput. Sci. 276, No. 1-2, 261-279 (2002). MSC: 68W25 05A05 68Q17 PDFBibTeX XMLCite \textit{D. F. Manlove} et al., Theor. Comput. Sci. 276, No. 1--2, 261--279 (2002; Zbl 1050.68171) Full Text: DOI
Fujito, Toshihiro; Nagamochi, Hiroshi A 2-approximation algorithm for the minimum weight edge dominating set problem. (English) Zbl 1016.68061 Discrete Appl. Math. 118, No. 3, 199-207 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{T. Fujito} and \textit{H. Nagamochi}, Discrete Appl. Math. 118, No. 3, 199--207 (2002; Zbl 1016.68061) Full Text: DOI
Guruswami, Venkatesan; Rangan, C. Pandu Algorithmic aspects of clique-transversal and clique-independent sets. (English) Zbl 0948.68135 Discrete Appl. Math. 100, No. 3, 183-202 (2000). MSC: 68R10 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{C. P. Rangan}, Discrete Appl. Math. 100, No. 3, 183--202 (2000; Zbl 0948.68135) Full Text: DOI
Manlove, David F. On the algorithmic complexity of twelve covering and independence parameters of graphs. (English) Zbl 0922.05041 Discrete Appl. Math. 91, No. 1-3, 155-175 (1999). Reviewer: Charles J.Colbourn (Burlington) MSC: 05C70 68R10 05C35 05C85 PDFBibTeX XMLCite \textit{D. F. Manlove}, Discrete Appl. Math. 91, No. 1--3, 155--175 (1999; Zbl 0922.05041) Full Text: DOI
Guruswami, Venkatesan; Rangan, C. Pandu A natural family of optimization problems with arbitrarily small approximation thresholds. (English) Zbl 1339.68118 Inf. Process. Lett. 68, No. 5, 241-248 (1998). MSC: 68Q25 68Q17 68W25 90C35 90C59 90C60 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{C. P. Rangan}, Inf. Process. Lett. 68, No. 5, 241--248 (1998; Zbl 1339.68118) Full Text: DOI Link
Cockayne, E. J.; Hattingh, J. H.; Hedetniemi, S. M.; Hedetniemi, S. T.; McRae, A. A. Using maximality and minimality conditions to construct inequality chains. (English) Zbl 0887.05031 Discrete Math. 176, No. 1-3, 43-61 (1997). Reviewer: E.J.F.Primrose (Leicester) MSC: 05C35 PDFBibTeX XMLCite \textit{E. J. Cockayne} et al., Discrete Math. 176, No. 1--3, 43--61 (1997; Zbl 0887.05031) Full Text: DOI
Srinivasan, Anand; Madhukar, K.; Nagavamsi, P.; Pandu Rangan, C.; Chang, Maw-Shang Edge domination on bipartite permutation graphs and cotriangulated graphs. (English) Zbl 0875.68697 Inf. Process. Lett. 56, No. 3, 165-171 (1995). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Srinivasan} et al., Inf. Process. Lett. 56, No. 3, 165--171 (1995; Zbl 0875.68697) Full Text: DOI