Li, Shiming; Yu, Wei; Liu, Zhaohui A local search algorithm for the \(k\)-path partition problem. (English) Zbl 07792593 Optim. Lett. 18, No. 1, 279-290 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{S. Li} et al., Optim. Lett. 18, No. 1, 279--290 (2024; Zbl 07792593) Full Text: DOI
Jin, Bo; Tanaka, Shunji An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. (English) Zbl 1524.90054 Eur. J. Oper. Res. 304, No. 2, 494-514 (2023). MSC: 90B06 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{B. Jin} and \textit{S. Tanaka}, Eur. J. Oper. Res. 304, No. 2, 494--514 (2023; Zbl 1524.90054) Full Text: DOI
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P.; Mondal, Joyashree Induced star partition of graphs. (English) Zbl 1494.05093 Discrete Appl. Math. 319, 81-91 (2022). MSC: 05C70 05C69 05C15 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{M. A. Shalu} et al., Discrete Appl. Math. 319, 81--91 (2022; Zbl 1494.05093) Full Text: DOI
Polten, Lukas; Emde, Simon Multi-shuttle crane scheduling in automated storage and retrieval systems. (English) Zbl 1507.90067 Eur. J. Oper. Res. 302, No. 3, 892-908 (2022). MSC: 90B35 90B06 PDFBibTeX XMLCite \textit{L. Polten} and \textit{S. Emde}, Eur. J. Oper. Res. 302, No. 3, 892--908 (2022; Zbl 1507.90067) Full Text: DOI
Darmann, Andreas; Döcker, Janosch; Dorn, Britta; Schneckenburger, Sebastian Simplified group activity selection with group size constraints. (English) Zbl 1484.91169 Int. J. Game Theory 51, No. 1, 169-212 (2022). MSC: 91B14 91A80 91B86 PDFBibTeX XMLCite \textit{A. Darmann} et al., Int. J. Game Theory 51, No. 1, 169--212 (2022; Zbl 1484.91169) Full Text: DOI
Mokeev, Dmitry B.; Malyshev, Dmitry S. On partial descriptions of König graphs for odd paths and all their spanning supergraphs. (English) Zbl 1487.90563 Optim. Lett. 16, No. 2, 481-496 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 16, No. 2, 481--496 (2022; Zbl 1487.90563) Full Text: DOI
Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura A greedy algorithm for the social golfer and the Oberwolfach problem. (English) Zbl 1495.05267 Eur. J. Oper. Res. 300, No. 1, 310-319 (2022). MSC: 05C70 05C38 90B35 90C27 05C85 PDFBibTeX XMLCite \textit{D. Schmand} et al., Eur. J. Oper. Res. 300, No. 1, 310--319 (2022; Zbl 1495.05267) Full Text: DOI arXiv
De Bontridder, K. M. J.; Halldórsson, B. V.; Halldórsson, M. M.; Hurkens, C. A. J.; Lenstra, J. K.; Ravi, R.; Stougie, L. Local improvement algorithms for a path packing problem: a performance analysis based on linear programming. (English) Zbl 1525.90414 Oper. Res. Lett. 49, No. 1, 62-68 (2021). MSC: 90C35 05C38 05C70 90C10 PDFBibTeX XMLCite \textit{K. M. J. De Bontridder} et al., Oper. Res. Lett. 49, No. 1, 62--68 (2021; Zbl 1525.90414) Full Text: DOI
Mokeev, Dmitriĭ Borisovich; Malyshev, Dmitriĭ Sergeevich On the König graphs for a 5-path and its spanning supergraphs. (Russian. English summary) Zbl 1493.05250 Diskretn. Anal. Issled. Oper. 27, No. 2, 90-116 (2020). MSC: 05C70 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 27, No. 2, 90--116 (2020; Zbl 1493.05250) Full Text: DOI MNR
Dai, Guowei; Hu, Zhiquan \(P_3\)-factors in the square of a tree. (English) Zbl 1459.05136 Graphs Comb. 36, No. 6, 1913-1925 (2020). MSC: 05C38 05C70 05C05 PDFBibTeX XMLCite \textit{G. Dai} and \textit{Z. Hu}, Graphs Comb. 36, No. 6, 1913--1925 (2020; Zbl 1459.05136) Full Text: DOI
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI
Knop, Dušan Partitioning graphs into induced subgraphs. (English) Zbl 1429.05166 Discrete Appl. Math. 272, 31-42 (2020). MSC: 05C70 05C42 05C85 PDFBibTeX XMLCite \textit{D. Knop}, Discrete Appl. Math. 272, 31--42 (2020; Zbl 1429.05166) Full Text: DOI arXiv
Malyshev, D. S.; Mokeev, D. B. König graphs with respect to the 4-path and its spanning supergraphs. (Russian, English) Zbl 1438.05143 Diskretn. Anal. Issled. Oper. 26, No. 1, 74-88 (2019); translation in J. Appl. Ind. Math. 13, No. 1, 85-92 (2019). MSC: 05C38 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{D. B. Mokeev}, Diskretn. Anal. Issled. Oper. 26, No. 1, 74--88 (2019; Zbl 1438.05143); translation in J. Appl. Ind. Math. 13, No. 1, 85--92 (2019) Full Text: DOI
Ning, Baoling; Li, Jianzhong; Jiang, Shouxu Balanced tree partition problems with virtual nodes. (English) Zbl 1426.90220 J. Comb. Optim. 37, No. 4, 1249-1265 (2019). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{B. Ning} et al., J. Comb. Optim. 37, No. 4, 1249--1265 (2019; Zbl 1426.90220) Full Text: DOI
Feng, Qilong; Huang, Neng; Jiang, Xiong; Wang, Jianxin Dealing with several parameterized problems by random methods. (English) Zbl 1393.68131 Theor. Comput. Sci. 734, 94-104 (2018). MSC: 68R10 05C70 05C85 68Q25 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 734, 94--104 (2018; Zbl 1393.68131) Full Text: DOI
Mnich, Matthias; van Leeuwen, Erik Jan Polynomial kernels for deletion to classes of acyclic digraphs. (English) Zbl 1387.68137 Discrete Optim. 25, 48-76 (2017). MSC: 68Q25 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Mnich} and \textit{E. J. van Leeuwen}, Discrete Optim. 25, 48--76 (2017; Zbl 1387.68137) Full Text: DOI Link
Mokeev, D. B. On König graphs with respect to \(P_4\). (Russian, English) Zbl 1399.05134 Diskretn. Anal. Issled. Oper. 24, No. 3, 61-79 (2017); translation in J. Appl. Ind. Math. 11, No. 3, 421-430 (2017). MSC: 05C38 05C12 PDFBibTeX XMLCite \textit{D. B. Mokeev}, Diskretn. Anal. Issled. Oper. 24, No. 3, 61--79 (2017; Zbl 1399.05134); translation in J. Appl. Ind. Math. 11, No. 3, 421--430 (2017) Full Text: DOI
Knop, Dušan Partitioning graphs into induced subgraphs. (English) Zbl 1487.68181 Drewes, Frank (ed.) et al., Language and automata theory and applications. 11th international conference, LATA 2017, Umeå, Sweden, March 6–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10168, 338-350 (2017). MSC: 68R10 05C70 05C85 68Q27 68W05 PDFBibTeX XMLCite \textit{D. Knop}, Lect. Notes Comput. Sci. 10168, 338--350 (2017; Zbl 1487.68181) Full Text: DOI arXiv
Björklund, Andreas; Husfeldt, Thore; Kaski, Petteri; Koivisto, Mikko Narrow sieves for parameterized paths and packings. (English) Zbl 1370.68321 J. Comput. Syst. Sci. 87, 119-139 (2017). MSC: 68W20 05C85 68R05 68R10 68W40 PDFBibTeX XMLCite \textit{A. Björklund} et al., J. Comput. Syst. Sci. 87, 119--139 (2017; Zbl 1370.68321) Full Text: DOI arXiv Link
Mathieson, Luke Graph editing problems with extended regularity constraints. (English) Zbl 1370.68137 Theor. Comput. Sci. 677, 56-68 (2017). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{L. Mathieson}, Theor. Comput. Sci. 677, 56--68 (2017; Zbl 1370.68137) Full Text: DOI arXiv
Baptiste, Philippe; Kovalyov, Mikhail Y.; Orlovich, Yury L.; Werner, Frank; Zverovich, Igor E. Graphs with maximal induced matchings of the same size. (English) Zbl 1350.05129 Discrete Appl. Math. 216, Part 1, 15-28 (2017). MSC: 05C70 05C35 68Q17 05C60 PDFBibTeX XMLCite \textit{P. Baptiste} et al., Discrete Appl. Math. 216, Part 1, 15--28 (2017; Zbl 1350.05129) Full Text: DOI
Feng, Qilong; Jiang, Xiong; Wang, Jianxin Improved algorithms for several parameterized problems based on random methods. (English) Zbl 1475.68462 Zhu, Daming (ed.) et al., Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9711, 65-74 (2016). MSC: 68W20 68Q27 68R10 68W40 PDFBibTeX XMLCite \textit{Q. Feng} et al., Lect. Notes Comput. Sci. 9711, 65--74 (2016; Zbl 1475.68462) Full Text: DOI
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs. (English) Zbl 1354.90104 J. Comb. Optim. 32, No. 2, 594-607 (2016). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{M.-S. Chang} et al., J. Comb. Optim. 32, No. 2, 594--607 (2016; Zbl 1354.90104) Full Text: DOI
Barbero, Florian; Gutin, Gregory; Jones, Mark; Sheng, Bin; Yeo, Anders Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths. (English) Zbl 1357.05121 Inf. Process. Lett. 116, No. 6, 433-436 (2016). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{F. Barbero} et al., Inf. Process. Lett. 116, No. 6, 433--436 (2016; Zbl 1357.05121) Full Text: DOI arXiv
Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín Using parametric transformations toward polynomial kernels for packing problems allowing overlaps. (English) Zbl 1347.68353 ACM Trans. Comput. Theory 7, No. 3, Article No. 13, 29 p. (2015). MSC: 68W05 05C70 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., ACM Trans. Comput. Theory 7, No. 3, Article No. 13, 29 p. (2015; Zbl 1347.68353) Full Text: DOI
Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín Kernelization algorithms for packing problems allowing overlaps. (English) Zbl 1460.68074 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9076, 415-427 (2015). MSC: 68R10 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{H. Fernau} et al., Lect. Notes Comput. Sci. 9076, 415--427 (2015; Zbl 1460.68074) Full Text: DOI arXiv
Neggazi, Brahim; Haddad, Mohammed; Kheddouci, Hamamache A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs. (English) Zbl 1331.68155 Inf. Process. Lett. 115, No. 11, 892-898 (2015). MSC: 68R10 05C51 05C85 68W15 PDFBibTeX XMLCite \textit{B. Neggazi} et al., Inf. Process. Lett. 115, No. 11, 892--898 (2015; Zbl 1331.68155) Full Text: DOI
Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid Covering tree with stars. (English) Zbl 1328.90119 J. Comb. Optim. 29, No. 1, 141-152 (2015). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{J. Baumbach} et al., J. Comb. Optim. 29, No. 1, 141--152 (2015; Zbl 1328.90119) Full Text: DOI
Feldmann, Andreas Emil; Foschini, Luca Balanced partitions of trees and applications. (English) Zbl 1315.68201 Algorithmica 71, No. 2, 354-376 (2015). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. E. Feldmann} and \textit{L. Foschini}, Algorithmica 71, No. 2, 354--376 (2015; Zbl 1315.68201) Full Text: DOI Link
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (English) Zbl 1315.68150 Theor. Comput. Sci. 565, 1-15 (2015). MSC: 68Q25 05C40 05C70 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 565, 1--15 (2015; Zbl 1315.68150) Full Text: DOI
Feng, Qilong; Wang, Jianxin; Chen, Jianer Matching and weighted \(P_2\)-packing: algorithms and kernels. (English) Zbl 1279.68101 Theor. Comput. Sci. 522, 85-94 (2014). MSC: 68Q17 05C85 05C70 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 522, 85--94 (2014; Zbl 1279.68101) Full Text: DOI
Binkele-Raible, Daniel; Fernau, Henning Packing paths: recycling saves time. (English) Zbl 1287.05112 Discrete Appl. Math. 161, No. 12, 1686-1698 (2013). MSC: 05C70 05C38 05C35 05C85 PDFBibTeX XMLCite \textit{D. Binkele-Raible} and \textit{H. Fernau}, Discrete Appl. Math. 161, No. 12, 1686--1698 (2013; Zbl 1287.05112) Full Text: DOI
Dell, Holger; Marx, Dániel Kernelization of packing problems. (English) Zbl 1421.68072 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 68-81 (2012). MSC: 68Q25 05C60 05C65 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{H. Dell} and \textit{D. Marx}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 68--81 (2012; Zbl 1421.68072) Full Text: arXiv Link
Rajasingh, Indra; Muthumalai, Albert; Bharati, R.; Shanthi, A. S. Packing in honeycomb networks. (English) Zbl 1407.05197 J. Math. Chem. 50, No. 5, 1200-1209 (2012). Reviewer: Niko Tratnik (Maribor) MSC: 05C70 92E10 05C82 05C90 PDFBibTeX XMLCite \textit{I. Rajasingh} et al., J. Math. Chem. 50, No. 5, 1200--1209 (2012; Zbl 1407.05197) Full Text: DOI
Orlovich, Yury; Dolgui, Alexandre; Finke, Gerd; Gordon, Valery; Werner, Frank The complexity of dissociation set problems in graphs. (English) Zbl 1223.68058 Discrete Appl. Math. 159, No. 13, 1352-1366 (2011). MSC: 68Q25 05C85 05C69 PDFBibTeX XMLCite \textit{Y. Orlovich} et al., Discrete Appl. Math. 159, No. 13, 1352--1366 (2011; Zbl 1223.68058) Full Text: DOI
Wang, Jianxin; Ning, Dan; Feng, Qilong; Chen, Jianer An improved kernelization for \(P_{2}\)-packing. (English) Zbl 1206.68354 Inf. Process. Lett. 110, No. 5, 188-192 (2010). MSC: 68W05 68R10 68R05 PDFBibTeX XMLCite \textit{J. Wang} et al., Inf. Process. Lett. 110, No. 5, 188--192 (2010; Zbl 1206.68354) Full Text: DOI
Fernau, Henning; Raible, Daniel A parameterized perspective on packing paths of length two. (English) Zbl 1184.90136 J. Comb. Optim. 18, No. 4, 319-341 (2009). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{D. Raible}, J. Comb. Optim. 18, No. 4, 319--341 (2009; Zbl 1184.90136) Full Text: DOI Link
Fernau, Henning; Manlove, David F. Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342 J. Discrete Algorithms 7, No. 2, 149-167 (2009). MSC: 68R10 68W25 68Q25 05C85 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{D. F. Manlove}, J. Discrete Algorithms 7, No. 2, 149--167 (2009; Zbl 1187.68342) Full Text: DOI
Cornelsen, Sabine; di Stefano, Gabriele Treelike comparability graphs. (English) Zbl 1204.05037 Discrete Appl. Math. 157, No. 8, 1711-1722 (2009). MSC: 05C05 05C70 PDFBibTeX XMLCite \textit{S. Cornelsen} and \textit{G. di Stefano}, Discrete Appl. Math. 157, No. 8, 1711--1722 (2009; Zbl 1204.05037) Full Text: DOI
Moser, Hannes A problem kernelization for graph packing. (English) Zbl 1206.68239 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 401-412 (2009). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{H. Moser}, Lect. Notes Comput. Sci. 5404, 401--412 (2009; Zbl 1206.68239) Full Text: DOI
Nikoloski, Zoran; Grimbs, Sergio; May, Patrick; Selbig, Joachim Metabolic networks are NP-hard to reconstruct. (English) Zbl 1400.92214 J. Theor. Biol. 254, No. 4, 807-816 (2008). MSC: 92C42 68Q25 92-04 05C90 PDFBibTeX XMLCite \textit{Z. Nikoloski} et al., J. Theor. Biol. 254, No. 4, 807--816 (2008; Zbl 1400.92214) Full Text: DOI
Fernau, Henning; Raible, Daniel A parameterized perspective on packing paths of length two. (English) Zbl 1168.05358 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 54-63 (2008). MSC: 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{D. Raible}, Lect. Notes Comput. Sci. 5165, 54--63 (2008; Zbl 1168.05358) Full Text: DOI
Li, Xiaojuan; Zhang, Zhao Path-factors in the square of a tree. (English) Zbl 1155.05053 Graphs Comb. 24, No. 2, 107-111 (2008). MSC: 05C70 05C38 05C05 PDFBibTeX XMLCite \textit{X. Li} and \textit{Z. Zhang}, Graphs Comb. 24, No. 2, 107--111 (2008; Zbl 1155.05053) Full Text: DOI
Orlovich, Yury; Finke, Gerd; Gordon, Valery; Zverovich, Igor Approximability results for the maximum and minimum maximal induced matching problems. (English) Zbl 1140.90479 Discrete Optim. 5, No. 3, 584-593 (2008). MSC: 90C27 90C35 68W25 68Q17 05C69 05C70 PDFBibTeX XMLCite \textit{Y. Orlovich} et al., Discrete Optim. 5, No. 3, 584--593 (2008; Zbl 1140.90479) Full Text: DOI Link
Yuster, Raphael Combinatorial and computational aspects of graph packing and graph decomposition. (English) Zbl 1302.05149 Comput. Sci. Rev. 1, No. 1, 12-26 (2007). MSC: 05C70 05C85 68Q25 05C07 05C65 05C80 05C20 05-02 PDFBibTeX XMLCite \textit{R. Yuster}, Comput. Sci. Rev. 1, No. 1, 12--26 (2007; Zbl 1302.05149) Full Text: DOI
Monnot, Jérôme; Toulouse, Sophie The path partition problem and related problems in bipartite graphs. (English) Zbl 1129.05034 Oper. Res. Lett. 35, No. 5, 677-684 (2007). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Monnot} and \textit{S. Toulouse}, Oper. Res. Lett. 35, No. 5, 677--684 (2007; Zbl 1129.05034) Full Text: DOI
Plummer, Michael D. Graph factors and factorization: 1985–2003: a survey. (English) Zbl 1112.05088 Discrete Math. 307, No. 7-8, 791-821 (2007). MSC: 05C70 05-02 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 307, No. 7--8, 791--821 (2007; Zbl 1112.05088) Full Text: DOI
Tsukiji, Tatsuie; Chen, Zhi-Zhong Computing phylogenetic roots with bounded degrees and errors is NP-complete. (English) Zbl 1153.68383 Theor. Comput. Sci. 363, No. 1, 43-59 (2006). MSC: 68Q17 05C05 05C69 68R10 92D15 PDFBibTeX XMLCite \textit{T. Tsukiji} and \textit{Z.-Z. Chen}, Theor. Comput. Sci. 363, No. 1, 43--59 (2006; Zbl 1153.68383) Full Text: DOI
Trotignon, Nicolas On the structure of self-complementary graphs. (English) Zbl 1182.05103 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 79-82 (2005). MSC: 05C75 PDFBibTeX XMLCite \textit{N. Trotignon}, Electron. Notes Discrete Math. 22, 79--82 (2005; Zbl 1182.05103) Full Text: DOI arXiv
Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme Approximation algorithms for some vehicle routing problems. (English) Zbl 1061.90006 Discrete Appl. Math. 146, No. 1, 27-42 (2005). MSC: 90B10 90C35 90C59 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Discrete Appl. Math. 146, No. 1, 27--42 (2005; Zbl 1061.90006) Full Text: DOI
Hassin, Refael; Rubinstein, Shlomi On the complexity of the \(k\)-customer vehicle routing problem. (English) Zbl 1076.90061 Oper. Res. Lett. 33, No. 1, 71-76 (2005). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{R. Hassin} and \textit{S. Rubinstein}, Oper. Res. Lett. 33, No. 1, 71--76 (2005; Zbl 1076.90061) Full Text: DOI
Kano, M.; Katona, G. Y.; Király, Z. Packing paths of length at least two. (English) Zbl 1042.05084 Discrete Math. 283, No. 1-3, 129-135 (2004). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{M. Kano} et al., Discrete Math. 283, No. 1--3, 129--135 (2004; Zbl 1042.05084) Full Text: DOI
Tóth, Csaba D. Illuminating disjoint line segments in the plane. (English) Zbl 1048.52013 Discrete Comput. Geom. 30, No. 3, 489-505 (2003). Reviewer: Horst Martini (Chemnitz) MSC: 52C45 52A10 52A37 PDFBibTeX XMLCite \textit{C. D. Tóth}, Discrete Comput. Geom. 30, No. 3, 489--505 (2003; Zbl 1048.52013) Full Text: DOI
Monnot, Jérôme Differential approximation of NP-hard problems with equal size feasible solutions. (English) Zbl 1037.90059 RAIRO, Oper. Res. 36, No. 4, 279-297 (2002). MSC: 90C59 90C60 68W25 68W40 90C35 PDFBibTeX XMLCite \textit{J. Monnot}, RAIRO, Oper. Res. 36, No. 4, 279--297 (2002; Zbl 1037.90059) Full Text: DOI Numdam EuDML Link
Dessmark, A.; Lingas, A.; Proskurowski, A. Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time. (English) Zbl 0938.68143 Theor. Comput. Sci. 236, No. 1-2, 179-191 (2000). MSC: 68W05 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Theor. Comput. Sci. 236, No. 1--2, 179--191 (2000; Zbl 0938.68143) Full Text: DOI
Kovacs, Tomas; Lingas, Andrzej Maximum packing for biconnected outerplanar graphs. (English) Zbl 0944.05075 Discrete Appl. Math. 100, No. 1-2, 85-94 (2000). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{T. Kovacs} and \textit{A. Lingas}, Discrete Appl. Math. 100, No. 1--2, 85--94 (2000; Zbl 0944.05075) Full Text: DOI
MacGillivray, Gary; Yu, Min-Li Generalized partitions of graphs. (English) Zbl 0917.05056 Discrete Appl. Math. 91, No. 1-3, 143-153 (1999). Reviewer: Guojun Li (Jinan) MSC: 05C70 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M.-L. Yu}, Discrete Appl. Math. 91, No. 1--3, 143--153 (1999; Zbl 0917.05056) Full Text: DOI
Guttmann-Beck, Nili; Hassin, Refael Approximation algorithms for min-sum \(p\)-clustering. (English) Zbl 0921.68044 Discrete Appl. Math. 89, No. 1-3, 125-142 (1998). MSC: 68W25 PDFBibTeX XMLCite \textit{N. Guttmann-Beck} and \textit{R. Hassin}, Discrete Appl. Math. 89, No. 1--3, 125--142 (1998; Zbl 0921.68044) Full Text: DOI
Lingas, Andrzej Maximum tree-packing in time \(O(n^{5/2})\). (English) Zbl 0901.68150 Theor. Comput. Sci. 181, No. 2, 307-316 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Lingas}, Theor. Comput. Sci. 181, No. 2, 307--316 (1997; Zbl 0901.68150) Full Text: DOI
Creignou, Nadia The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness. (English) Zbl 0874.68127 Theor. Comput. Sci. 145, No. 1-2, 111-145 (1995). MSC: 68Q15 68Q05 PDFBibTeX XMLCite \textit{N. Creignou}, Theor. Comput. Sci. 145, No. 1--2, 111--145 (1995; Zbl 0874.68127) Full Text: DOI
Naumann, Valeska Measuring the distance to series-parallelity by path expressions. (English) Zbl 1528.68316 Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 269-281 (1995). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{V. Naumann}, Lect. Notes Comput. Sci. 903, 269--281 (1995; Zbl 1528.68316) Full Text: DOI
Lingas, Andrzej Maximum tree-packing in time \(O(n^{5/2})\). (English) Zbl 1527.68165 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 121-130 (1995). MSC: 68R10 05C05 05C70 68Q25 PDFBibTeX XMLCite \textit{A. Lingas}, Lect. Notes Comput. Sci. 959, 121--130 (1995; Zbl 1527.68165) Full Text: DOI
Hansen, Pierre; Hertz, Alain; Kuplinsky, Julio Bounded vertex colorings of graphs. (English) Zbl 0782.05032 Discrete Math. 111, No. 1-3, 305-312 (1993). MSC: 05C15 05C35 68Q25 05C75 PDFBibTeX XMLCite \textit{P. Hansen} et al., Discrete Math. 111, No. 1--3, 305--312 (1993; Zbl 0782.05032) Full Text: DOI
Akiyama, Jin; Chvátal, Vašek Packing paths perfectly. (English) Zbl 0723.05092 Discrete Math. 85, No. 3, 247-255 (1990). Reviewer: Ma Zhongfan (Beijing) MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{J. Akiyama} and \textit{V. Chvátal}, Discrete Math. 85, No. 3, 247--255 (1990; Zbl 0723.05092) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by complete bipartite graphs. (English) Zbl 0597.05050 SIAM J. Algebraic Discrete Methods 7, 199-209 (1986). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, SIAM J. Algebraic Discrete Methods 7, 199--209 (1986; Zbl 0597.05050) Full Text: DOI
Monien, Burkhard; Sudborough, Ivan Hal Bandwidth contrained NP-complete problems. (English) Zbl 0618.68043 Theor. Comput. Sci. 41, 141-167 (1985). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Monien} and \textit{I. H. Sudborough}, Theor. Comput. Sci. 41, 141--167 (1985; Zbl 0618.68043) Full Text: DOI
Dyer, M. E.; Frieze, A. M. On the complexity of partitioning graphs into connected subgraphs. (English) Zbl 0562.68030 Discrete Appl. Math. 10, 139-153 (1985). Reviewer: D.Yu.Grigorev MSC: 68Q25 68R10 05C70 05C40 05A17 PDFBibTeX XMLCite \textit{M. E. Dyer} and \textit{A. M. Frieze}, Discrete Appl. Math. 10, 139--153 (1985; Zbl 0562.68030) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by cliques and by finite families of graphs. (English) Zbl 0582.05046 Discrete Math. 49, 45-59 (1984). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Discrete Math. 49, 45--59 (1984; Zbl 0582.05046) Full Text: DOI Backlinks: MO
Hell, P.; Kirkpatrick, D. G. On generalized matching problems. (English) Zbl 0454.68077 Inf. Process. Lett. 12, 33-35 (1981). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Inf. Process. Lett. 12, 33--35 (1981; Zbl 0454.68077) Full Text: DOI