Dong, Yanni; Broersma, Hajo; Bai, Yuhang; Zhang, Shenggui The complexity of spanning tree problems involving graphical indices. (English) Zbl 07809932 Discrete Appl. Math. 347, 143-154 (2024). MSC: 05C05 05C09 68Q17 92E10 05C92 PDFBibTeX XMLCite \textit{Y. Dong} et al., Discrete Appl. Math. 347, 143--154 (2024; Zbl 07809932) Full Text: DOI
Bai, Yandong; Bang-Jensen, Jørgen; Fujita, Shinya; Ono, Hirotaka; Yeo, Anders Safe sets and in-dominating sets in digraphs. (English) Zbl 07804727 Discrete Appl. Math. 346, 215-227 (2024). MSC: 05C20 05C69 05C45 68Q25 68W05 PDFBibTeX XMLCite \textit{Y. Bai} et al., Discrete Appl. Math. 346, 215--227 (2024; Zbl 07804727) Full Text: DOI
Numaguchi, Hiroki; Wu, Wei; Hu, Yannan Two-machine job-shop scheduling with one joint job. (English) Zbl 07804716 Discrete Appl. Math. 346, 30-43 (2024). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{H. Numaguchi} et al., Discrete Appl. Math. 346, 30--43 (2024; Zbl 07804716) Full Text: DOI
Casel, Katrin; Friedrich, Tobias; Neubert, Stefan; Schmid, Markus L. Shortest distances as enumeration problem. (English) Zbl 07794318 Discrete Appl. Math. 342, 89-103 (2024). MSC: 05C12 05C35 05C30 PDFBibTeX XMLCite \textit{K. Casel} et al., Discrete Appl. Math. 342, 89--103 (2024; Zbl 07794318) Full Text: DOI arXiv
Panda, B. S.; Goyal, Pooja Hardness results of global Roman domination in graphs. (English) Zbl 1526.05110 Discrete Appl. Math. 341, 337-348 (2023). Reviewer: Saeid Alikhani (Yazd) MSC: 05C69 68W05 68Q17 PDFBibTeX XMLCite \textit{B. S. Panda} and \textit{P. Goyal}, Discrete Appl. Math. 341, 337--348 (2023; Zbl 1526.05110) Full Text: DOI
Asratian, Armen S.; Casselgren, Carl Johan; Petrosyan, Petros A. Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules. (English) Zbl 1514.05127 Discrete Appl. Math. 335, 25-35 (2023). MSC: 05C70 05C15 90B35 PDFBibTeX XMLCite \textit{A. S. Asratian} et al., Discrete Appl. Math. 335, 25--35 (2023; Zbl 1514.05127) Full Text: DOI arXiv
Korbacher, Laura; Irnich, Stefan; Martinovic, John; Strasdat, Nico Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model. (English) Zbl 1518.90090 Discrete Appl. Math. 334, 145-162 (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{L. Korbacher} et al., Discrete Appl. Math. 334, 145--162 (2023; Zbl 1518.90090) Full Text: DOI
Chen, Benjamin; Cho, Michael; Tutuncu-Macias, Mario; Tzolov, Tony Efficient methods of calculating the number of heapable permutations. (English) Zbl 07669161 Discrete Appl. Math. 331, 126-137 (2023). MSC: 68R05 68Wxx 60Cxx PDFBibTeX XMLCite \textit{B. Chen} et al., Discrete Appl. Math. 331, 126--137 (2023; Zbl 07669161) Full Text: DOI
Goerigk, Marc; Hartisch, Michael Combinatorial optimization problems with balanced regret. (English) Zbl 1512.90196 Discrete Appl. Math. 328, 40-59 (2023). MSC: 90C27 90C17 PDFBibTeX XMLCite \textit{M. Goerigk} and \textit{M. Hartisch}, Discrete Appl. Math. 328, 40--59 (2023; Zbl 1512.90196) Full Text: DOI arXiv
Könen, David; Schmidt, Daniel; Spisla, Christiane Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem. (English) Zbl 1500.90080 Discrete Appl. Math. 321, 333-349 (2022). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{D. Könen} et al., Discrete Appl. Math. 321, 333--349 (2022; Zbl 1500.90080) Full Text: DOI arXiv
Abu-Affash, A. Karim; Carmi, Paz; Krasin, Adi A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph. (English) Zbl 1495.05201 Discrete Appl. Math. 320, 488-499 (2022). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{A. K. Abu-Affash} et al., Discrete Appl. Math. 320, 488--499 (2022; Zbl 1495.05201) Full Text: DOI arXiv
Korenblit, Mark; Levit, Vadim E. On lengths of edge-labeled graph expressions. (English) Zbl 1494.05096 Discrete Appl. Math. 319, 583-594 (2022). MSC: 05C78 05C25 05C20 68R10 68Q25 PDFBibTeX XMLCite \textit{M. Korenblit} and \textit{V. E. Levit}, Discrete Appl. Math. 319, 583--594 (2022; Zbl 1494.05096) Full Text: DOI
Mandal, Subhrangsu; Gupta, Arobinda Maximum 0-1 timed matching on temporal graphs. (English) Zbl 1494.05101 Discrete Appl. Math. 319, 310-326 (2022). MSC: 05C82 05C70 68Q17 PDFBibTeX XMLCite \textit{S. Mandal} and \textit{A. Gupta}, Discrete Appl. Math. 319, 310--326 (2022; Zbl 1494.05101) Full Text: DOI arXiv
Zorzenon, Davide; Komenda, Jan; Raisch, Jörg The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory. (English) Zbl 1491.90177 Discrete Appl. Math. 315, 56-70 (2022). MSC: 90C35 PDFBibTeX XMLCite \textit{D. Zorzenon} et al., Discrete Appl. Math. 315, 56--70 (2022; Zbl 1491.90177) Full Text: DOI arXiv
Chanchary, Farah; Maheshwari, Anil; Smid, Michiel Window queries for intersecting objects, maximal points and approximations using coresets. (English) Zbl 1528.68090 Discrete Appl. Math. 305, 295-310 (2021). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{F. Chanchary} et al., Discrete Appl. Math. 305, 295--310 (2021; Zbl 1528.68090) Full Text: DOI
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I.; Zirondelli, Elia C. A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points. (English) Zbl 1523.68047 Discrete Appl. Math. 305, 103-108 (2021). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{M. Cairo} et al., Discrete Appl. Math. 305, 103--108 (2021; Zbl 1523.68047) Full Text: DOI
Cichacz, Sylwia; Suchan, Karol Minimum \(k\)-critical bipartite graphs. (English) Zbl 1469.05085 Discrete Appl. Math. 302, 54-66 (2021). MSC: 05C35 05C82 05C85 PDFBibTeX XMLCite \textit{S. Cichacz} and \textit{K. Suchan}, Discrete Appl. Math. 302, 54--66 (2021; Zbl 1469.05085) Full Text: DOI arXiv
Dumitrescu, Adrian Finding a mediocre player. (English) Zbl 1512.68474 Discrete Appl. Math. 293, 15-24 (2021). MSC: 68W40 68R05 68W05 68W20 PDFBibTeX XMLCite \textit{A. Dumitrescu}, Discrete Appl. Math. 293, 15--24 (2021; Zbl 1512.68474) Full Text: DOI
Eom, Sookyung; Lee, Hyang-Sook; Lim, Seongan; Song, Kyunghwan Analysis on Yu et al.’s dynamic algorithm for canonic DBC. (English) Zbl 1462.94035 Discrete Appl. Math. 294, 31-40 (2021). MSC: 94A60 68W40 PDFBibTeX XMLCite \textit{S. Eom} et al., Discrete Appl. Math. 294, 31--40 (2021; Zbl 1462.94035) Full Text: DOI
Asahiro, Yuichi; Furukawa, Tetsuya; Ikegami, Keiichi; Miyano, Eiji; Yagita, Tsuyoshi How to pack directed acyclic graphs into small blocks. (English) Zbl 1451.05188 Discrete Appl. Math. 288, 91-113 (2021). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Discrete Appl. Math. 288, 91--113 (2021; Zbl 1451.05188) Full Text: DOI
Daescu, Ovidiu; Teo, Ka Yaw Two-dimensional closest pair problem: a closer look. (English) Zbl 1458.68265 Discrete Appl. Math. 287, 85-96 (2020). Reviewer: Krzysztof Gdawiec (Sosnowiec) MSC: 68U05 PDFBibTeX XMLCite \textit{O. Daescu} and \textit{K. Y. Teo}, Discrete Appl. Math. 287, 85--96 (2020; Zbl 1458.68265) Full Text: DOI
Haraguchi, Kazuya; Torii, Kotaro; Endo, Motomu Maximum weighted matching with few edge crossings for 2-layered bipartite graph. (English) Zbl 1448.05097 Discrete Appl. Math. 287, 40-52 (2020). MSC: 05C22 05C35 05C70 05C85 PDFBibTeX XMLCite \textit{K. Haraguchi} et al., Discrete Appl. Math. 287, 40--52 (2020; Zbl 1448.05097) Full Text: DOI arXiv
Mankowski, Michal; Moshkov, Mikhail Dynamic programming bi-criteria combinatorial optimization. (English) Zbl 1446.90139 Discrete Appl. Math. 284, 513-533 (2020). MSC: 90C27 90C29 90C39 PDFBibTeX XMLCite \textit{M. Mankowski} and \textit{M. Moshkov}, Discrete Appl. Math. 284, 513--533 (2020; Zbl 1446.90139) Full Text: DOI
Stewart, Iain A. Using semidirect products of groups to build classes of interconnection networks. (English) Zbl 1442.05090 Discrete Appl. Math. 283, 78-97 (2020). MSC: 05C25 05C82 94C15 PDFBibTeX XMLCite \textit{I. A. Stewart}, Discrete Appl. Math. 283, 78--97 (2020; Zbl 1442.05090) Full Text: DOI Link
Renjith, P.; Sadagopan, N. The Steiner tree in \(K_{1,r}\)-free split graphs – a dichotomy. (English) Zbl 1439.05053 Discrete Appl. Math. 280, 246-255 (2020). MSC: 05C05 05C40 68Q25 PDFBibTeX XMLCite \textit{P. Renjith} and \textit{N. Sadagopan}, Discrete Appl. Math. 280, 246--255 (2020; Zbl 1439.05053) Full Text: DOI
Sundara Rajan, R.; Rajalaxmi, T. M.; Liu, Jia-Bao; Sethuraman, G. Wirelength of embedding complete multipartite graphs into certain graphs. (English) Zbl 1439.05162 Discrete Appl. Math. 280, 221-236 (2020). MSC: 05C60 05C38 PDFBibTeX XMLCite \textit{R. Sundara Rajan} et al., Discrete Appl. Math. 280, 221--236 (2020; Zbl 1439.05162) Full Text: DOI
Erofeev, Evgeny; Barylska, Kamila; Mikulski, Łukasz; Piątkowski, Marcin Generating all minimal Petri net unsolvable binary words. (English) Zbl 1434.68244 Discrete Appl. Math. 274, 35-53 (2020). MSC: 68Q45 68Q85 68R15 PDFBibTeX XMLCite \textit{E. Erofeev} et al., Discrete Appl. Math. 274, 35--53 (2020; Zbl 1434.68244) Full Text: DOI
Anderson, Matthew; Williamson, Matthew; Subramani, K. Empirical analysis of algorithms for the shortest negative cost cycle problem. (English) Zbl 1401.05276 Discrete Appl. Math. 253, 167-184 (2019). MSC: 05C85 05C22 05C82 PDFBibTeX XMLCite \textit{M. Anderson} et al., Discrete Appl. Math. 253, 167--184 (2019; Zbl 1401.05276) Full Text: DOI
Pandey, Arti; Panda, B. S. Domination in some subclasses of bipartite graphs. (English) Zbl 1401.05222 Discrete Appl. Math. 252, 51-66 (2019). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{A. Pandey} and \textit{B. S. Panda}, Discrete Appl. Math. 252, 51--66 (2019; Zbl 1401.05222) Full Text: DOI
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane The \(S\)-labeling problem: an algorithmic tour. (English) Zbl 1390.05202 Discrete Appl. Math. 246, 49-61 (2018). MSC: 05C78 05C85 05C07 PDFBibTeX XMLCite \textit{G. Fertin} et al., Discrete Appl. Math. 246, 49--61 (2018; Zbl 1390.05202) Full Text: DOI
Orlin, James B.; Subramani, K.; Wojciechowki, Piotr Randomized algorithms for finding the shortest negative cost cycle in networks. (English) Zbl 1377.05181 Discrete Appl. Math. 236, 387-394 (2018). MSC: 05C82 05C85 68W20 68Q25 PDFBibTeX XMLCite \textit{J. B. Orlin} et al., Discrete Appl. Math. 236, 387--394 (2018; Zbl 1377.05181) Full Text: DOI Link
Sou, Kin Cheong Minimum equivalent precedence relation systems. (English) Zbl 1372.05092 Discrete Appl. Math. 233, 195-214 (2017). MSC: 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{K. C. Sou}, Discrete Appl. Math. 233, 195--214 (2017; Zbl 1372.05092) Full Text: DOI arXiv
Kasperski, Adam; Zieliński, Paweł Robust recoverable and two-stage selection problems. (English) Zbl 1382.90088 Discrete Appl. Math. 233, 52-64 (2017). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Kasperski} and \textit{P. Zieliński}, Discrete Appl. Math. 233, 52--64 (2017; Zbl 1382.90088) Full Text: DOI arXiv
Korenblit, M. Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs. (English) Zbl 1365.05112 Discrete Appl. Math. 228, 60-72 (2017). MSC: 05C20 PDFBibTeX XMLCite \textit{M. Korenblit}, Discrete Appl. Math. 228, 60--72 (2017; Zbl 1365.05112) Full Text: DOI
Mäkinen, Veli; Staneva, Valeria; Tomescu, Alexandru I.; Valenzuela, Daniel; Wilzbach, Sebastian Interval scheduling maximizing minimum coverage. (English) Zbl 1370.68040 Discrete Appl. Math. 225, 130-135 (2017). MSC: 68M20 68W25 90B35 92D20 PDFBibTeX XMLCite \textit{V. Mäkinen} et al., Discrete Appl. Math. 225, 130--135 (2017; Zbl 1370.68040) Full Text: DOI arXiv Link
Malmberg, Filip; Luengo Hendriks, Cris L.; Strand, Robin Exact evaluation of targeted stochastic watershed cuts. (English) Zbl 1370.68311 Discrete Appl. Math. 216, Part 2, 449-460 (2017). MSC: 68U10 PDFBibTeX XMLCite \textit{F. Malmberg} et al., Discrete Appl. Math. 216, Part 2, 449--460 (2017; Zbl 1370.68311) Full Text: DOI
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej Fixed-parameter algorithms for DAG partitioning. (English) Zbl 1355.05204 Discrete Appl. Math. 220, 134-160 (2017). MSC: 05C70 05C85 05C82 05C12 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Discrete Appl. Math. 220, 134--160 (2017; Zbl 1355.05204) Full Text: DOI arXiv
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim On the shortest path game. (English) Zbl 1351.05152 Discrete Appl. Math. 217, Part 1, 3-18 (2017). MSC: 05C57 05C38 05C12 91A43 91A05 PDFBibTeX XMLCite \textit{A. Darmann} et al., Discrete Appl. Math. 217, Part 1, 3--18 (2017; Zbl 1351.05152) Full Text: DOI
Panda, B. S.; Pandey, Arti Algorithmic aspects of open neighborhood location-domination in graphs. (English) Zbl 1350.05124 Discrete Appl. Math. 216, Part 1, 290-306 (2017). MSC: 05C69 05C85 05C07 68W25 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. S. Panda} and \textit{A. Pandey}, Discrete Appl. Math. 216, Part 1, 290--306 (2017; Zbl 1350.05124) Full Text: DOI
Hirsch, M.; Ish-Shalom, A.; Klein, S. T. Optimal partitioning of data chunks in deduplication systems. (English) Zbl 1350.68096 Discrete Appl. Math. 212, 104-114 (2016). MSC: 68P30 PDFBibTeX XMLCite \textit{M. Hirsch} et al., Discrete Appl. Math. 212, 104--114 (2016; Zbl 1350.68096) Full Text: DOI
Aronovich, L.; Asher, R.; Harnik, D.; Hirsch, M.; Klein, S. T.; Toaff, Y. Similarity based deduplication with small data chunks. (English) Zbl 1350.68095 Discrete Appl. Math. 212, 10-22 (2016). MSC: 68P30 PDFBibTeX XMLCite \textit{L. Aronovich} et al., Discrete Appl. Math. 212, 10--22 (2016; Zbl 1350.68095) Full Text: DOI
Dourado, Mitre C.; Sampaio, Rudini M. Complexity aspects of the triangle path convexity. (English) Zbl 1335.05045 Discrete Appl. Math. 206, 39-47 (2016). MSC: 05C10 05C38 52B99 PDFBibTeX XMLCite \textit{M. C. Dourado} and \textit{R. M. Sampaio}, Discrete Appl. Math. 206, 39--47 (2016; Zbl 1335.05045) Full Text: DOI arXiv
Jaberi, Raed On computing the 2-vertex-connected components of directed graphs. (English) Zbl 1333.05136 Discrete Appl. Math. 204, 164-172 (2016). MSC: 05C20 05C40 05C85 68W25 PDFBibTeX XMLCite \textit{R. Jaberi}, Discrete Appl. Math. 204, 164--172 (2016; Zbl 1333.05136) Full Text: DOI arXiv
Corneil, Derek G.; Dusart, Jérémie; Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien A tie-break model for graph search. (English) Zbl 1326.05151 Discrete Appl. Math. 199, 89-100 (2016). MSC: 05C85 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 199, 89--100 (2016; Zbl 1326.05151) Full Text: DOI arXiv
Brignall, Robert; Lozin, Vadim V.; Stacho, Juraj Bichain graphs: geometric model and universal graphs. (English) Zbl 1326.05119 Discrete Appl. Math. 199, 16-29 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{R. Brignall} et al., Discrete Appl. Math. 199, 16--29 (2016; Zbl 1326.05119) Full Text: DOI
Jawaid, Syed Talha; Smith, Stephen L. Informative path planning as a maximum traveling salesman problem with submodular rewards. (English) Zbl 1311.05103 Discrete Appl. Math. 186, 112-127 (2015). MSC: 05C45 05C35 05C22 90C35 PDFBibTeX XMLCite \textit{S. T. Jawaid} and \textit{S. L. Smith}, Discrete Appl. Math. 186, 112--127 (2015; Zbl 1311.05103) Full Text: DOI arXiv
Hung, Ruo-Wei The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks. (English) Zbl 1304.68140 Discrete Appl. Math. 181, 109-122 (2015). MSC: 68R10 05C45 05C85 68M10 PDFBibTeX XMLCite \textit{R.-W. Hung}, Discrete Appl. Math. 181, 109--122 (2015; Zbl 1304.68140) Full Text: DOI
Lee, Chia-Wei; Chen, Pin-Liang; Hsieh, Sun-Yuan Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths. (English) Zbl 1303.05088 Discrete Appl. Math. 180, 126-134 (2015). MSC: 05C30 05C35 05C42 05C38 05C05 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{C.-W. Lee} et al., Discrete Appl. Math. 180, 126--134 (2015; Zbl 1303.05088) Full Text: DOI
Gamst, Mette Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem. (English) Zbl 1329.68054 Discrete Appl. Math. 164, Part 1, 121-137 (2014). MSC: 68M20 68Q17 90B35 90C59 PDFBibTeX XMLCite \textit{M. Gamst}, Discrete Appl. Math. 164, Part 1, 121--137 (2014; Zbl 1329.68054) Full Text: DOI
Hirsch, M.; Klein, S. T.; Toaff, Y. Improving deduplication techniques by accelerating remainder calculations. (English) Zbl 1329.68096 Discrete Appl. Math. 163, Part 3, 307-315 (2014). MSC: 68P20 68P05 PDFBibTeX XMLCite \textit{M. Hirsch} et al., Discrete Appl. Math. 163, Part 3, 307--315 (2014; Zbl 1329.68096) Full Text: DOI
Manea, Florin; Mercaş, Robert; Tiseanu, Cătălin An algorithmic toolbox for periodic partial words. (English) Zbl 1314.68253 Discrete Appl. Math. 179, 174-192 (2014). MSC: 68R15 68Q25 68W32 PDFBibTeX XMLCite \textit{F. Manea} et al., Discrete Appl. Math. 179, 174--192 (2014; Zbl 1314.68253) Full Text: DOI
Kranakis, Evangelos On the event distance of Poisson processes with applications to sensors. (English) Zbl 1311.60053 Discrete Appl. Math. 179, 152-162 (2014). Reviewer: Yuliya S. Mishura (Kyïv) MSC: 60G51 60J75 PDFBibTeX XMLCite \textit{E. Kranakis}, Discrete Appl. Math. 179, 152--162 (2014; Zbl 1311.60053) Full Text: DOI
Feng, Min; Wang, Kaishun Identifying codes of corona product graphs. (English) Zbl 1288.05213 Discrete Appl. Math. 169, 88-96 (2014). MSC: 05C76 05C69 PDFBibTeX XMLCite \textit{M. Feng} and \textit{K. Wang}, Discrete Appl. Math. 169, 88--96 (2014; Zbl 1288.05213) Full Text: DOI arXiv
Ceselli, Alberto; Colombo, Fabio; Cordone, Roberto Balanced compact clustering for efficient range queries in metric spaces. (English) Zbl 1358.68090 Discrete Appl. Math. 169, 43-67 (2014). MSC: 68P20 68T20 PDFBibTeX XMLCite \textit{A. Ceselli} et al., Discrete Appl. Math. 169, 43--67 (2014; Zbl 1358.68090) Full Text: DOI
Arockiaraj, Micheal; Quadras, Jasintha; Rajasingh, Indra; Shalini, Arul Jeya Embedding of hypercubes into sibling trees. (English) Zbl 1288.05176 Discrete Appl. Math. 169, 9-14 (2014). MSC: 05C60 05C65 05C05 PDFBibTeX XMLCite \textit{M. Arockiaraj} et al., Discrete Appl. Math. 169, 9--14 (2014; Zbl 1288.05176) Full Text: DOI
Milanič, Martin; Schaudt, Oliver Computing square roots of trivially perfect and threshold graphs. (English) Zbl 1287.05095 Discrete Appl. Math. 161, No. 10-11, 1538-1545 (2013). MSC: 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Milanič} and \textit{O. Schaudt}, Discrete Appl. Math. 161, No. 10--11, 1538--1545 (2013; Zbl 1287.05095) Full Text: DOI
Hossain, Shahadat; Steihaug, Trond Graph models and their efficient implementation for sparse Jacobian matrix determination. (English) Zbl 1287.05155 Discrete Appl. Math. 161, No. 12, 1747-1754 (2013). MSC: 05C90 15B99 68R10 68P05 PDFBibTeX XMLCite \textit{S. Hossain} and \textit{T. Steihaug}, Discrete Appl. Math. 161, No. 12, 1747--1754 (2013; Zbl 1287.05155) Full Text: DOI
Asahiro, Yuichi; Miyano, Eiji; Murata, Toshihide; Ono, Hirotaka Optimal approximability of bookmark assignments. (English) Zbl 1285.05074 Discrete Appl. Math. 161, No. 16-17, 2361-2366 (2013). MSC: 05C20 68R10 68M11 68W25 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Discrete Appl. Math. 161, No. 16--17, 2361--2366 (2013; Zbl 1285.05074) Full Text: DOI
Rajasingh, Indra; Manuel, Paul; Rajan, Bharati; Arockiaraj, M. Wirelength of hypercubes into certain trees. (English) Zbl 1253.68265 Discrete Appl. Math. 160, No. 18, 2778-2786 (2012). MSC: 68R10 68M10 05C05 05C65 05C60 PDFBibTeX XMLCite \textit{I. Rajasingh} et al., Discrete Appl. Math. 160, No. 18, 2778--2786 (2012; Zbl 1253.68265) Full Text: DOI
Nouri, Mostafa; Ghodsi, Mohammad Scheduling tasks with exponential duration on unrelated parallel machines. (English) Zbl 1248.68121 Discrete Appl. Math. 160, No. 16-17, 2462-2473 (2012). MSC: 68M20 90B36 68Q17 PDFBibTeX XMLCite \textit{M. Nouri} and \textit{M. Ghodsi}, Discrete Appl. Math. 160, No. 16--17, 2462--2473 (2012; Zbl 1248.68121) Full Text: DOI
Meeks, Kitty; Scott, Alexander The complexity of flood-filling games on graphs. (English) Zbl 1239.05122 Discrete Appl. Math. 160, No. 7-8, 959-969 (2012). MSC: 05C57 91A46 90C60 PDFBibTeX XMLCite \textit{K. Meeks} and \textit{A. Scott}, Discrete Appl. Math. 160, No. 7--8, 959--969 (2012; Zbl 1239.05122) Full Text: DOI
Schiffer, T.; Aurenhammer, F.; Demuth, M. Computing convex quadrangulations. (English) Zbl 1236.68282 Discrete Appl. Math. 160, No. 4-5, 648-656 (2012). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{T. Schiffer} et al., Discrete Appl. Math. 160, No. 4--5, 648--656 (2012; Zbl 1236.68282) Full Text: DOI
Ilić, Aleksandar Distance spectral radius of trees with given matching number. (English) Zbl 1208.05018 Discrete Appl. Math. 158, No. 16, 1799-1806 (2010). MSC: 05C10 05C50 PDFBibTeX XMLCite \textit{A. Ilić}, Discrete Appl. Math. 158, No. 16, 1799--1806 (2010; Zbl 1208.05018) Full Text: DOI
Katrenič, J.; Semanišin, G. Finding monotone paths in edge-ordered graphs. (English) Zbl 1208.05061 Discrete Appl. Math. 158, No. 15, 1624-1632 (2010). MSC: 05C38 PDFBibTeX XMLCite \textit{J. Katrenič} and \textit{G. Semanišin}, Discrete Appl. Math. 158, No. 15, 1624--1632 (2010; Zbl 1208.05061) Full Text: DOI
Wu, Zhilin; Grumbach, Stéphane Feasibility of motion planning on acyclic and strongly connected directed graphs. (English) Zbl 1230.05192 Discrete Appl. Math. 158, No. 9, 1017-1028 (2010). MSC: 05C40 05C20 68T40 PDFBibTeX XMLCite \textit{Z. Wu} and \textit{S. Grumbach}, Discrete Appl. Math. 158, No. 9, 1017--1028 (2010; Zbl 1230.05192) Full Text: DOI
Adi, Said S.; Braga, Marília D. V.; Fernandes, Cristina G.; Ferreira, Carlos E.; Martinez, Fábio Viduani; Sagot, Marie-France; Stefanes, Marco A.; Tjandraatmadja, Christian; Wakabayashi, Yoshiko Repetition-free longest common subsequence. (English) Zbl 1226.05002 Discrete Appl. Math. 158, No. 12, 1315-1324 (2010). MSC: 05A05 68W25 PDFBibTeX XMLCite \textit{S. S. Adi} et al., Discrete Appl. Math. 158, No. 12, 1315--1324 (2010; Zbl 1226.05002) Full Text: DOI
Cattaneo, G.; Faruolo, P.; Petrillo, U. Ferraro; Italiano, G. F. Maintaining dynamic minimum spanning trees: an experimental study. (English) Zbl 1225.05080 Discrete Appl. Math. 158, No. 5, 404-425 (2010). MSC: 05C05 05C85 PDFBibTeX XMLCite \textit{G. Cattaneo} et al., Discrete Appl. Math. 158, No. 5, 404--425 (2010; Zbl 1225.05080) Full Text: DOI
Balakrishnan, Kannan; Brešar, Boštjan; Changat, Manoj; Imrich, Wilfried; Klavžar, Sandi; Kovše, Matjaž; Subhamathi, Ajitha R. On the remoteness function in median graphs. (English) Zbl 1227.05137 Discrete Appl. Math. 157, No. 18, 3679-3688 (2009). MSC: 05C12 PDFBibTeX XMLCite \textit{K. Balakrishnan} et al., Discrete Appl. Math. 157, No. 18, 3679--3688 (2009; Zbl 1227.05137) Full Text: DOI Link
Asano, Tetsuo; Brimkov, Valentin E.; Barneva, Reneta P. Some theoretical challenges in digital geometry: a perspective. (English) Zbl 1186.68487 Discrete Appl. Math. 157, No. 16, 3362-3371 (2009). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Asano} et al., Discrete Appl. Math. 157, No. 16, 3362--3371 (2009; Zbl 1186.68487) Full Text: DOI
Marx, Dániel; Schlotter, Ildikó Parameterized graph cleaning problems. (English) Zbl 1209.05248 Discrete Appl. Math. 157, No. 15, 3258-3267 (2009). MSC: 05C85 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Marx} and \textit{I. Schlotter}, Discrete Appl. Math. 157, No. 15, 3258--3267 (2009; Zbl 1209.05248) Full Text: DOI
Fomin, Fedor V.; Mazoit, Frédéric; Todinca, Ioan Computing branchwidth via efficient triangulations and blocks. (English) Zbl 1211.05163 Discrete Appl. Math. 157, No. 12, 2726-2736 (2009). MSC: 05C85 05C12 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 157, No. 12, 2726--2736 (2009; Zbl 1211.05163) Full Text: DOI HAL
di Crescenzo, Giovanni; Galdi, Clemente Hypergraph decomposition and secret sharing. (English) Zbl 1163.94430 Discrete Appl. Math. 157, No. 5, 928-946 (2009). MSC: 94A60 05C65 PDFBibTeX XMLCite \textit{G. di Crescenzo} and \textit{C. Galdi}, Discrete Appl. Math. 157, No. 5, 928--946 (2009; Zbl 1163.94430) Full Text: DOI
Gargano, Luisa; Rescigno, Adele A. Collision-free path coloring with application to minimum-delay gathering in sensor networks. (English) Zbl 1198.68181 Discrete Appl. Math. 157, No. 8, 1858-1872 (2009). MSC: 68R10 05C85 05C15 05C38 PDFBibTeX XMLCite \textit{L. Gargano} and \textit{A. A. Rescigno}, Discrete Appl. Math. 157, No. 8, 1858--1872 (2009; Zbl 1198.68181) 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
Sivignon, Isabelle; Coeurjolly, David Minimum decomposition of a digital surface into digital plane segments is NP-hard. (English) Zbl 1168.68049 Discrete Appl. Math. 157, No. 3, 558-570 (2009). MSC: 68U10 68Q17 68U05 PDFBibTeX XMLCite \textit{I. Sivignon} and \textit{D. Coeurjolly}, Discrete Appl. Math. 157, No. 3, 558--570 (2009; Zbl 1168.68049) Full Text: DOI
Hanen, Claire; Kordon, Alix Munier Periodic schedules for linear precedence constraints. (English) Zbl 1155.90383 Discrete Appl. Math. 157, No. 2, 280-291 (2009). MSC: 90B35 90C35 90C05 PDFBibTeX XMLCite \textit{C. Hanen} and \textit{A. M. Kordon}, Discrete Appl. Math. 157, No. 2, 280--291 (2009; Zbl 1155.90383) Full Text: DOI
Ishizeki, Tetsuya; Otachi, Yota; Yamazaki, Koichi An improved algorithm for the longest induced path problem on \(k\)-chordal graphs. (English) Zbl 1186.05114 Discrete Appl. Math. 156, No. 15, 3057-3059 (2008). MSC: 05C85 05C35 05C38 68R10 PDFBibTeX XMLCite \textit{T. Ishizeki} et al., Discrete Appl. Math. 156, No. 15, 3057--3059 (2008; Zbl 1186.05114) Full Text: DOI
Rafalin, Eynat; Souvaine, Diane L. Topological sweep of the complete graph. (English) Zbl 1161.05028 Discrete Appl. Math. 156, No. 17, 3276-3290 (2008). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{E. Rafalin} and \textit{D. L. Souvaine}, Discrete Appl. Math. 156, No. 17, 3276--3290 (2008; Zbl 1161.05028) Full Text: DOI
Emamy-K, M. R.; Ziegler, M. On the coverings of the \(d\)-cube for \(d\leq 6\). (English) Zbl 1160.52017 Discrete Appl. Math. 156, No. 17, 3156-3165 (2008). MSC: 52C17 PDFBibTeX XMLCite \textit{M. R. Emamy-K} and \textit{M. Ziegler}, Discrete Appl. Math. 156, No. 17, 3156--3165 (2008; Zbl 1160.52017) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas On the parallel computation of the biconnected and strongly connected co-components of graphs. (English) Zbl 1123.05086 Discrete Appl. Math. 155, No. 14, 1858-1877 (2007). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Appl. Math. 155, No. 14, 1858--1877 (2007; Zbl 1123.05086) Full Text: DOI
Cordone, Roberto A subexponential algorithm for the coloured tree partition problem. (English) Zbl 1120.68110 Discrete Appl. Math. 155, No. 10, 1326-1335 (2007). MSC: 68W05 05C85 68Q17 68Q25 90C27 68R10 PDFBibTeX XMLCite \textit{R. Cordone}, Discrete Appl. Math. 155, No. 10, 1326--1335 (2007; Zbl 1120.68110) Full Text: DOI
Zaker, Manouchehr Maximum transversal in partial Latin squares and rainbow matchings. (English) Zbl 1161.05017 Discrete Appl. Math. 155, No. 4, 558-565 (2007). Reviewer: V. S. Ramamurthi (Jacksonville) MSC: 05B15 05C70 68R10 PDFBibTeX XMLCite \textit{M. Zaker}, Discrete Appl. Math. 155, No. 4, 558--565 (2007; Zbl 1161.05017) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing; Ibarra, Louis Recognizing and representing proper interval graphs in parallel using merging and sorting. (English) Zbl 1109.68079 Discrete Appl. Math. 155, No. 4, 442-456 (2007). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 155, No. 4, 442--456 (2007; Zbl 1109.68079) Full Text: DOI
Björklund, Henrik; Vorobyov, Sergei A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. (English) Zbl 1176.68087 Discrete Appl. Math. 155, No. 2, 210-229 (2007). MSC: 68Q25 05C85 91A05 91A10 91A43 PDFBibTeX XMLCite \textit{H. Björklund} and \textit{S. Vorobyov}, Discrete Appl. Math. 155, No. 2, 210--229 (2007; Zbl 1176.68087) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders; Tso, Michael Level of repair analysis and minimum cost homomorphisms of graphs. (English) Zbl 1131.90020 Discrete Appl. Math. 154, No. 6, 881-889 (2006). MSC: 90B25 90B06 05C20 05C69 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Appl. Math. 154, No. 6, 881--889 (2006; Zbl 1131.90020) Full Text: DOI Link
Dean, Brian C. A simple expected running time analysis for randomized “divide and conquer” algorithms. (English) Zbl 1083.68149 Discrete Appl. Math. 154, No. 1, 1-5 (2006). MSC: 68W40 68W20 68P10 PDFBibTeX XMLCite \textit{B. C. Dean}, Discrete Appl. Math. 154, No. 1, 1--5 (2006; Zbl 1083.68149) Full Text: DOI
Carvalho, Bruno M.; Herman, Gabor T.; Kong, T. Yung Simultaneous fuzzy segmentation of multiple objects. (English) Zbl 1101.68922 Discrete Appl. Math. 151, No. 1-3, 55-77 (2005). MSC: 68U10 PDFBibTeX XMLCite \textit{B. M. Carvalho} et al., Discrete Appl. Math. 151, No. 1--3, 55--77 (2005; Zbl 1101.68922) Full Text: DOI
Biedl, Therese; Chan, Timothy; Ganjali, Yashar; Hajiaghayi, Mohammad Taghi; Wood, David R. Balanced vertex-orderings of graphs. (English) Zbl 1060.05088 Discrete Appl. Math. 148, No. 1, 27-48 (2005). MSC: 05C85 05C10 68R10 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Appl. Math. 148, No. 1, 27--48 (2005; Zbl 1060.05088) Full Text: DOI
Palbom, Anna Complexity of the directed spanning cactus problem. (English) Zbl 1087.90081 Discrete Appl. Math. 146, No. 1, 81-91 (2005). MSC: 90C35 68R10 PDFBibTeX XMLCite \textit{A. Palbom}, Discrete Appl. Math. 146, No. 1, 81--91 (2005; Zbl 1087.90081) Full Text: DOI
Yamada, T.; Ohtsuka, T.; Watanabe, A.; Ueno, S. On sequential diagnosis of multiprocessor systems. (English) Zbl 1077.68011 Discrete Appl. Math. 146, No. 3, 311-342 (2005). MSC: 68M20 68M15 90B25 PDFBibTeX XMLCite \textit{T. Yamada} et al., Discrete Appl. Math. 146, No. 3, 311--342 (2005; Zbl 1077.68011) Full Text: DOI
Morin, Pat; Morrison, Jason The geometry of carpentry and joinery. (English) Zbl 1062.68130 Discrete Appl. Math. 144, No. 3, 374-380 (2004). MSC: 68U05 68U10 PDFBibTeX XMLCite \textit{P. Morin} and \textit{J. Morrison}, Discrete Appl. Math. 144, No. 3, 374--380 (2004; Zbl 1062.68130) Full Text: DOI
Smid, Michiel; Ray, Rahul; Wendt, Ulrich; Lange, Katharina Computing large planar regions in terrains, with an application to fracture surfaces. (English) Zbl 1076.68105 Discrete Appl. Math. 139, No. 1-3, 253-264 (2004). MSC: 68U05 PDFBibTeX XMLCite \textit{M. Smid} et al., Discrete Appl. Math. 139, No. 1--3, 253--264 (2004; Zbl 1076.68105) Full Text: DOI
Gülpinar, N.; Gutin, G.; Mitra, G.; Zverovitch, A. Extracting pure network submatrices in linear programs using signed graphs. (English) Zbl 1095.90112 Discrete Appl. Math. 137, No. 3, 359-372 (2004). MSC: 90C35 90C05 90C59 05C22 PDFBibTeX XMLCite \textit{N. Gülpinar} et al., Discrete Appl. Math. 137, No. 3, 359--372 (2004; Zbl 1095.90112) Full Text: DOI
Li, Chu-Min Equivalent literal propagation in the DLL procedure. (English) Zbl 1029.68080 Discrete Appl. Math. 130, No. 2, 251-276 (2003). MSC: 68Q25 PDFBibTeX XMLCite \textit{C.-M. Li}, Discrete Appl. Math. 130, No. 2, 251--276 (2003; Zbl 1029.68080) Full Text: DOI
Moukrim, Aziz Scheduling unitary task systems with zero–one communication delays for quasi-interval orders. (English) Zbl 1025.68009 Discrete Appl. Math. 127, No. 3, 461-476 (2003). MSC: 68M20 PDFBibTeX XMLCite \textit{A. Moukrim}, Discrete Appl. Math. 127, No. 3, 461--476 (2003; Zbl 1025.68009) Full Text: DOI
Bermond, J-C.; Bond, J.; Peleg, D.; Perennes, S. The power of small coalitions in graphs. (English) Zbl 1025.68061 Discrete Appl. Math. 127, No. 3, 399-414 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{J-C. Bermond} et al., Discrete Appl. Math. 127, No. 3, 399--414 (2003; Zbl 1025.68061) Full Text: DOI
Hauptmeier, D.; Krumke, S. O.; Rambau, J.; Wirth, H.-C. Euler is standing in line dial-a-ride problems with precedence-constraints. (English) Zbl 0990.90015 Discrete Appl. Math. 113, No. 1, 87-107 (2001). MSC: 90B20 90C35 90C59 PDFBibTeX XMLCite \textit{D. Hauptmeier} et al., Discrete Appl. Math. 113, No. 1, 87--107 (2001; Zbl 0990.90015) Full Text: DOI
Jagota, Arun; Narasimhan, Giri; Šoltés, Ľubomír A generalization of maximal independent sets. (English) Zbl 0976.68117 Discrete Appl. Math. 109, No. 3, 223-235 (2001). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Jagota} et al., Discrete Appl. Math. 109, No. 3, 223--235 (2001; Zbl 0976.68117) Full Text: DOI
Mumey, Brendan Probe location in the presence of errors: A problem from DNA mapping. (English) Zbl 0956.92020 Discrete Appl. Math. 104, No. 1-3, 187-201 (2000). MSC: 92C40 05C90 PDFBibTeX XMLCite \textit{B. Mumey}, Discrete Appl. Math. 104, No. 1--3, 187--201 (2000; Zbl 0956.92020) Full Text: DOI
Wu, Bang Ye; Chao, Kun-Mao; Tang, Chuan Yi Approximation algorithms for some optimum communication spanning tree problems. (English) Zbl 0957.68088 Discrete Appl. Math. 102, No. 3, 245-266 (2000). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{B. Y. Wu} et al., Discrete Appl. Math. 102, No. 3, 245--266 (2000; Zbl 0957.68088) Full Text: DOI