Babecki, Catherine; Shiroma, David Eigenpolytope universality and graphical designs. (English) Zbl 07818432 SIAM J. Discrete Math. 38, No. 1, 947-964 (2024). MSC: 05C50 68R10 68Q17 52B12 52B35 90C60 PDFBibTeX XMLCite \textit{C. Babecki} and \textit{D. Shiroma}, SIAM J. Discrete Math. 38, No. 1, 947--964 (2024; Zbl 07818432) Full Text: DOI arXiv
Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna Geometric network creation games. (English) Zbl 07793140 SIAM J. Discrete Math. 38, No. 1, 277-315 (2024). MSC: 91A43 91A68 91A11 68Q17 PDFBibTeX XMLCite \textit{D. Bilò} et al., SIAM J. Discrete Math. 38, No. 1, 277--315 (2024; Zbl 07793140) Full Text: DOI arXiv
Skotnica, Michael; Tancer, Martin NP-hardness of computing PL geometric category in dimension 2. (English) Zbl 07742533 SIAM J. Discrete Math. 37, No. 3, 2016-2029 (2023). Reviewer: Stephan Rosebrock (Karlsruhe) MSC: 55M30 57Q10 68Q17 05E45 PDFBibTeX XMLCite \textit{M. Skotnica} and \textit{M. Tancer}, SIAM J. Discrete Math. 37, No. 3, 2016--2029 (2023; Zbl 07742533) Full Text: DOI arXiv
Chan, Swee Hong; Pak, Igor; Panova, Greta Effective poset inequalities. (English) Zbl 1520.05017 SIAM J. Discrete Math. 37, No. 3, 1842-1880 (2023). MSC: 05A20 05A30 68Q17 06A07 PDFBibTeX XMLCite \textit{S. H. Chan} et al., SIAM J. Discrete Math. 37, No. 3, 1842--1880 (2023; Zbl 1520.05017) Full Text: DOI arXiv
Peyerimhoff, Norbert; Roth, Marc; Schmitt, Johannes; Stix, Jakob; Vdovina, Alina; Wellnitz, Philip Parameterized counting and Cayley graph expanders. (English) Zbl 07690451 SIAM J. Discrete Math. 37, No. 2, 405-486 (2023). MSC: 68Q27 68Q17 68R10 05E40 05C48 11F06 11R52 20F65 PDFBibTeX XMLCite \textit{N. Peyerimhoff} et al., SIAM J. Discrete Math. 37, No. 2, 405--486 (2023; Zbl 07690451) Full Text: DOI
Koana, Tomohiro; Komusiewicz, Christian; Sommer, Frank Exploiting \(c\)-closure in kernelization algorithms for graph problems. (English) Zbl 1503.05118 SIAM J. Discrete Math. 36, No. 4, 2798-2821 (2022). MSC: 05C85 05C55 68Q17 68Q25 68Q27 68R10 PDFBibTeX XMLCite \textit{T. Koana} et al., SIAM J. Discrete Math. 36, No. 4, 2798--2821 (2022; Zbl 1503.05118) Full Text: DOI arXiv
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601 SIAM J. Discrete Math. 36, No. 3, 1761-1787 (2022). MSC: 68Q27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 36, No. 3, 1761--1787 (2022; Zbl 07572601) Full Text: DOI arXiv
Bergren, Dan; Eiben, Eduard; Ganian, Robert; Kanj, Iyad On covering segments with unit intervals. (English) Zbl 07537554 SIAM J. Discrete Math. 36, No. 2, 1200-1230 (2022). MSC: 68Q27 68Q25 PDFBibTeX XMLCite \textit{D. Bergren} et al., SIAM J. Discrete Math. 36, No. 2, 1200--1230 (2022; Zbl 07537554) Full Text: DOI
Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Okamoto, Yoshio Shortest reconfiguration of perfect matchings via alternating cycles. (English) Zbl 1487.05207 SIAM J. Discrete Math. 36, No. 2, 1102-1123 (2022). MSC: 05C70 05C85 52B05 68Q17 PDFBibTeX XMLCite \textit{T. Ito} et al., SIAM J. Discrete Math. 36, No. 2, 1102--1123 (2022; Zbl 1487.05207) Full Text: DOI
Bitar, Nicolas; Goles, Eric; Montealegre, Pedro Computational complexity of biased diffusion-limited aggregation. (English) Zbl 07510392 SIAM J. Discrete Math. 36, No. 1, 823-866 (2022). MSC: 03D15 68Q17 68Q10 PDFBibTeX XMLCite \textit{N. Bitar} et al., SIAM J. Discrete Math. 36, No. 1, 823--866 (2022; Zbl 07510392) Full Text: DOI arXiv
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; Powers, Vladlena Understanding popular matchings via stable matchings. (English) Zbl 1483.91135 SIAM J. Discrete Math. 36, No. 1, 188-213 (2022). MSC: 91B68 05C90 68Q17 PDFBibTeX XMLCite \textit{Á. Cseh} et al., SIAM J. Discrete Math. 36, No. 1, 188--213 (2022; Zbl 1483.91135) Full Text: DOI arXiv
Lafond, Manuel; Zhu, Binhai; Zou, Peng Computing the tandem duplication distance is NP-hard. (English) Zbl 1483.68504 SIAM J. Discrete Math. 36, No. 1, 64-91 (2022). MSC: 68W32 68Q17 68Q27 68Q45 92D10 PDFBibTeX XMLCite \textit{M. Lafond} et al., SIAM J. Discrete Math. 36, No. 1, 64--91 (2022; Zbl 1483.68504) Full Text: DOI arXiv
Long, Philip M. Superlinear integrality gaps for the minimum majority problem. (English) Zbl 07453660 SIAM J. Discrete Math. 35, No. 4, 3004-3016 (2021). MSC: 68W25 68Q17 68Q25 68T05 90C10 90C57 PDFBibTeX XMLCite \textit{P. M. Long}, SIAM J. Discrete Math. 35, No. 4, 3004--3016 (2021; Zbl 07453660) Full Text: DOI
Focke, Jacob; Goldberg, Leslie Ann; Roth, Marc; Živný, Stanislav Counting homomorphisms to \(K_4\)-minor-free graphs, modulo 2. (English) Zbl 07436465 SIAM J. Discrete Math. 35, No. 4, 2749-2814 (2021). MSC: 68R10 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Focke} et al., SIAM J. Discrete Math. 35, No. 4, 2749--2814 (2021; Zbl 07436465) Full Text: DOI arXiv
Srinivasan, Srikanth; Tripathi, Utkarsh; Venkitesh, S. On the probabilistic degrees of symmetric Boolean functions. (English) Zbl 1527.68088 SIAM J. Discrete Math. 35, No. 3, 2070-2092 (2021). MSC: 68Q25 06E30 68Q06 68Q10 68Q17 PDFBibTeX XMLCite \textit{S. Srinivasan} et al., SIAM J. Discrete Math. 35, No. 3, 2070--2092 (2021; Zbl 1527.68088) Full Text: DOI arXiv
Jukna, Stasys Notes on hazard-free circuits. (English) Zbl 1476.68084 SIAM J. Discrete Math. 35, No. 2, 770-787 (2021). MSC: 68Q06 68Q17 94C11 PDFBibTeX XMLCite \textit{S. Jukna}, SIAM J. Discrete Math. 35, No. 2, 770--787 (2021; Zbl 1476.68084) Full Text: DOI arXiv
Dvořák, Pavel; Feldmann, Andreas E.; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1462.68138 SIAM J. Discrete Math. 35, No. 1, 546-574 (2021). MSC: 68R10 05C05 05C85 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{P. Dvořák} et al., SIAM J. Discrete Math. 35, No. 1, 546--574 (2021; Zbl 1462.68138) Full Text: DOI
Kushilevitz, Eyal; Ostrovsky, Rafail; Prouff, Emmanuel; Rosén, Adi; Thillard, Adrian; Vergnaud, Damien Lower and upper bounds on the randomness complexity of private computations of AND. (English) Zbl 1462.68073 SIAM J. Discrete Math. 35, No. 1, 465-484 (2021). MSC: 68Q17 68Q11 94A60 94D10 PDFBibTeX XMLCite \textit{E. Kushilevitz} et al., SIAM J. Discrete Math. 35, No. 1, 465--484 (2021; Zbl 1462.68073) Full Text: DOI
Hartarsky, Ivailo; Mezei, Tamás Róbert Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness. (English) Zbl 1462.68070 SIAM J. Discrete Math. 34, No. 2, 1444-1459 (2020). MSC: 68Q17 60C05 60K35 68Q80 PDFBibTeX XMLCite \textit{I. Hartarsky} and \textit{T. R. Mezei}, SIAM J. Discrete Math. 34, No. 2, 1444--1459 (2020; Zbl 1462.68070) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Going far from degeneracy. (English) Zbl 1451.05229 SIAM J. Discrete Math. 34, No. 3, 1587-1601 (2020). MSC: 05C85 05C12 05C38 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 34, No. 3, 1587--1601 (2020; Zbl 1451.05229) Full Text: DOI arXiv
Lampis, Michael Finer tight bounds for coloring on clique-width. (English) Zbl 1462.68143 SIAM J. Discrete Math. 34, No. 3, 1538-1558 (2020). MSC: 68R10 05C15 05C85 68Q17 68Q27 68W40 PDFBibTeX XMLCite \textit{M. Lampis}, SIAM J. Discrete Math. 34, No. 3, 1538--1558 (2020; Zbl 1462.68143) Full Text: DOI arXiv
Bulteau, Laurent; Froese, Vincent; Niedermeier, Rolf Tight hardness results for consensus problems on circular strings and time series. (English) Zbl 1462.68065 SIAM J. Discrete Math. 34, No. 3, 1854-1883 (2020). MSC: 68Q17 62M10 68Q25 68Q27 68W32 68W40 PDFBibTeX XMLCite \textit{L. Bulteau} et al., SIAM J. Discrete Math. 34, No. 3, 1854--1883 (2020; Zbl 1462.68065) Full Text: DOI arXiv
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Parameterized (approximate) defective coloring. (English) Zbl 1433.68178 SIAM J. Discrete Math. 34, No. 2, 1084-1106 (2020). MSC: 68Q27 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 34, No. 2, 1084--1106 (2020; Zbl 1433.68178) Full Text: DOI
Alon, Noga; Cohen, Jonathan D.; Griffiths, Thomas L.; Manurangsi, Pasin; Reichman, Daniel; Shinkar, Igor; Wagner, Tal; Yu, Alexander Multitasking capacity: hardness results and improved constructions. (English) Zbl 1434.68183 SIAM J. Discrete Math. 34, No. 1, 885-903 (2020). MSC: 68Q17 05C70 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 34, No. 1, 885--903 (2020; Zbl 1434.68183) Full Text: DOI arXiv
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan Solving partition problems almost always requires pushing many vertices around. (English) Zbl 1434.05123 SIAM J. Discrete Math. 34, No. 1, 640-681 (2020). MSC: 05C70 05C85 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{I. Kanj} et al., SIAM J. Discrete Math. 34, No. 1, 640--681 (2020; Zbl 1434.05123) Full Text: DOI
Guruswami, Venkatesan; Sandeep, Sai Rainbow coloring hardness via low sensitivity polymorphisms. (English) Zbl 1448.68356 SIAM J. Discrete Math. 34, No. 1, 520-537 (2020). MSC: 68R10 05C15 05C65 68Q17 68W25 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{S. Sandeep}, SIAM J. Discrete Math. 34, No. 1, 520--537 (2020; Zbl 1448.68356) Full Text: DOI
Wrochna, Marcin Homomorphism reconfiguration via homotopy. (English) Zbl 1448.68249 SIAM J. Discrete Math. 34, No. 1, 328-350 (2020). MSC: 68Q25 05C15 05E45 68Q17 PDFBibTeX XMLCite \textit{M. Wrochna}, SIAM J. Discrete Math. 34, No. 1, 328--350 (2020; Zbl 1448.68249) Full Text: DOI
Grigorescu, Elena; Kumar, Akash; Wimmer, Karl Flipping out with many flips: hardness of testing \(k\)-monotonicity. (English) Zbl 1493.68396 SIAM J. Discrete Math. 33, No. 4, 2111-2125 (2019). MSC: 68W20 68Q17 PDFBibTeX XMLCite \textit{E. Grigorescu} et al., SIAM J. Discrete Math. 33, No. 4, 2111--2125 (2019; Zbl 1493.68396) Full Text: DOI
Burton, Benjamin; Cabello, Sergio; Kratsch, Stefan; Pettersson, William The parameterized complexity of finding a 2-sphere in a simplicial complex. (English) Zbl 1432.57051 SIAM J. Discrete Math. 33, No. 4, 2092-2110 (2019). Reviewer: Basudeb Datta (Bangalore) MSC: 57Q05 57Q15 57K20 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Burton} et al., SIAM J. Discrete Math. 33, No. 4, 2092--2110 (2019; Zbl 1432.57051) Full Text: DOI Backlinks: MO
Babka, Martin; Bulánek, Jan; Čunát, Vladimŕ; Koucký, Michal; Saks, Michael E. On online labeling with large label set. (English) Zbl 1429.68333 SIAM J. Discrete Math. 33, No. 3, 1175-1193 (2019). MSC: 68W27 68P05 68Q17 PDFBibTeX XMLCite \textit{M. Babka} et al., SIAM J. Discrete Math. 33, No. 3, 1175--1193 (2019; Zbl 1429.68333) Full Text: DOI
Durocher, Stephane; Mondal, Debajyoti Relating graph thickness to planar layers and bend complexity. (English) Zbl 1400.05063 SIAM J. Discrete Math. 32, No. 4, 2703-2719 (2018). MSC: 05C10 05C62 05C30 68Q17 PDFBibTeX XMLCite \textit{S. Durocher} and \textit{D. Mondal}, SIAM J. Discrete Math. 32, No. 4, 2703--2719 (2018; Zbl 1400.05063) Full Text: DOI arXiv
Abel, Zachary; Alvarez, Victor; Demaine, Erik D.; Fekete, Sándor P.; Gour, Aman; Hesterberg, Adam; Keldenich, Phillip; Scheffer, Christian Conflict-free coloring of graphs. (English) Zbl 1400.05060 SIAM J. Discrete Math. 32, No. 4, 2675-2702 (2018). MSC: 05C10 05C15 05C69 05C83 68Q17 PDFBibTeX XMLCite \textit{Z. Abel} et al., SIAM J. Discrete Math. 32, No. 4, 2675--2702 (2018; Zbl 1400.05060) Full Text: DOI arXiv
Cairns, Hannah Some halting problems for abelian sandpiles are undecidable in dimension three. (English) Zbl 1403.68133 SIAM J. Discrete Math. 32, No. 4, 2636-2666 (2018). MSC: 68Q80 68Q05 68Q10 68Q17 91A43 PDFBibTeX XMLCite \textit{H. Cairns}, SIAM J. Discrete Math. 32, No. 4, 2636--2666 (2018; Zbl 1403.68133) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Structured connectivity augmentation. (English) Zbl 1400.05134 SIAM J. Discrete Math. 32, No. 4, 2612-2635 (2018). MSC: 05C40 05C85 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 32, No. 4, 2612--2635 (2018; Zbl 1400.05134) Full Text: DOI arXiv
Grohe, Martin; Kreutzer, Stephan; Rabinovich, Roman; Siebertz, Sebastian; Stavropoulos, Konstantinos Coloring and covering nowhere dense graphs. (English) Zbl 1398.05121 SIAM J. Discrete Math. 32, No. 4, 2467-2481 (2018). MSC: 05C42 05C15 05C75 05C83 05C90 68Q17 PDFBibTeX XMLCite \textit{M. Grohe} et al., SIAM J. Discrete Math. 32, No. 4, 2467--2481 (2018; Zbl 1398.05121) Full Text: DOI
Deza, Antoine; Levin, Asaf; Meesum, Syed M.; Onn, Shmuel Optimization over degree sequences. (English) Zbl 1392.05083 SIAM J. Discrete Math. 32, No. 3, 2067-2079 (2018). MSC: 05C65 05C07 05D05 68Q17 90C27 PDFBibTeX XMLCite \textit{A. Deza} et al., SIAM J. Discrete Math. 32, No. 3, 2067--2079 (2018; Zbl 1392.05083) Full Text: DOI arXiv
Bar-Yehuda, Reuven; Kantor, Erez; Kutten, Shay; Rawitz, Dror Growing half-balls: minimizing storage and communication costs in content delivery networks. (English) Zbl 1398.68658 SIAM J. Discrete Math. 32, No. 3, 1903-1921 (2018). MSC: 68W25 68M11 68P20 68Q17 68W27 PDFBibTeX XMLCite \textit{R. Bar-Yehuda} et al., SIAM J. Discrete Math. 32, No. 3, 1903--1921 (2018; Zbl 1398.68658) Full Text: DOI
Kowalik, Łukasz; Lauri, Juho; Socała, Arkadiusz On the fine-grained complexity of rainbow coloring. (English) Zbl 1395.05060 SIAM J. Discrete Math. 32, No. 3, 1672-1705 (2018). MSC: 05C15 05C85 68W05 68Q17 68Q25 PDFBibTeX XMLCite \textit{Ł. Kowalik} et al., SIAM J. Discrete Math. 32, No. 3, 1672--1705 (2018; Zbl 1395.05060) Full Text: DOI
Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo; Mouawad, Amer E.; Saurabh, Saket Kernelization of cycle packing with relaxed disjointness constraints. (English) Zbl 1397.68088 SIAM J. Discrete Math. 32, No. 3, 1619-1643 (2018). MSC: 68Q25 05C38 05C70 68Q17 68R10 PDFBibTeX XMLCite \textit{A. Agrawal} et al., SIAM J. Discrete Math. 32, No. 3, 1619--1643 (2018; Zbl 1397.68088) Full Text: DOI
Alpers, Andreas; Gritzmann, Peter On double-resolution imaging and discrete tomography. (English) Zbl 1395.68321 SIAM J. Discrete Math. 32, No. 2, 1369-1399 (2018). MSC: 68U10 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Alpers} and \textit{P. Gritzmann}, SIAM J. Discrete Math. 32, No. 2, 1369--1399 (2018; Zbl 1395.68321) Full Text: DOI arXiv
Coudert, David; Ducoffe, Guillaume Revisiting decomposition by clique separators. (English) Zbl 1383.05256 SIAM J. Discrete Math. 32, No. 1, 682-694 (2018). MSC: 05C70 05C10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Coudert} and \textit{G. Ducoffe}, SIAM J. Discrete Math. 32, No. 1, 682--694 (2018; Zbl 1383.05256) Full Text: DOI
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds. (English) Zbl 1388.68112 SIAM J. Discrete Math. 32, No. 1, 656-681 (2018). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., SIAM J. Discrete Math. 32, No. 1, 656--681 (2018; Zbl 1388.68112) Full Text: DOI arXiv
Zehavi, Meirav Maximum minimal vertex cover parameterized by vertex cover. (English) Zbl 1380.68236 SIAM J. Discrete Math. 31, No. 4, 2440-2456 (2017). MSC: 68Q25 05C85 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{M. Zehavi}, SIAM J. Discrete Math. 31, No. 4, 2440--2456 (2017; Zbl 1380.68236) Full Text: DOI
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli Popular matchings with two-sided preferences and one-sided ties. (English) Zbl 1372.05168 SIAM J. Discrete Math. 31, No. 4, 2348-2377 (2017). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{Á. Cseh} et al., SIAM J. Discrete Math. 31, No. 4, 2348--2377 (2017; Zbl 1372.05168) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Krokhin, Andrei; Powell, Robert; Živný, Stanislav Binarisation for valued constraint satisfaction problems. (English) Zbl 1477.68121 SIAM J. Discrete Math. 31, No. 4, 2279-2300 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Discrete Math. 31, No. 4, 2279--2300 (2017; Zbl 1477.68121) Full Text: DOI arXiv
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh Shortest reconfiguration paths in the solution space of Boolean formulas. (English) Zbl 1374.68247 SIAM J. Discrete Math. 31, No. 3, 2185-2200 (2017). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., SIAM J. Discrete Math. 31, No. 3, 2185--2200 (2017; Zbl 1374.68247) Full Text: DOI
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K. Partial vertex cover and budgeted maximum coverage in bipartite graphs. (English) Zbl 1376.68051 SIAM J. Discrete Math. 31, No. 3, 2172-2184 (2017). MSC: 68Q17 05C70 05C85 68W25 PDFBibTeX XMLCite \textit{B. Caskurlu} et al., SIAM J. Discrete Math. 31, No. 3, 2172--2184 (2017; Zbl 1376.68051) Full Text: DOI
Guruswami, Venkatesan; Lee, Euiwoong Inapproximability of \(H\)-transversal/packing. (English) Zbl 1371.68099 SIAM J. Discrete Math. 31, No. 3, 1552-1571 (2017). MSC: 68Q17 05C70 68W25 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{E. Lee}, SIAM J. Discrete Math. 31, No. 3, 1552--1571 (2017; Zbl 1371.68099) Full Text: DOI
Disser, Yann; Klimm, Max; Megow, Nicole; Stiller, Sebastian Packing a knapsack of unknown capacity. (English) Zbl 1370.68329 SIAM J. Discrete Math. 31, No. 3, 1477-1497 (2017). MSC: 68W25 68Q17 68Q25 68W27 90C27 PDFBibTeX XMLCite \textit{Y. Disser} et al., SIAM J. Discrete Math. 31, No. 3, 1477--1497 (2017; Zbl 1370.68329) Full Text: DOI arXiv
Bar-Noy, Amotz; Rawitz, Dror; Terlecky, Peter Maximizing barrier coverage lifetime with mobile sensors. (English) Zbl 1370.68327 SIAM J. Discrete Math. 31, No. 1, 573-596 (2017). MSC: 68W25 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., SIAM J. Discrete Math. 31, No. 1, 573--596 (2017; Zbl 1370.68327) Full Text: DOI arXiv
Aravind, N. R.; Sandeep, R. B.; Sivadasan, Naveen Dichotomy results on the hardness of \(H\)-free edge modification problems. (English) Zbl 1370.68225 SIAM J. Discrete Math. 31, No. 1, 542-561 (2017). MSC: 68R10 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{N. R. Aravind} et al., SIAM J. Discrete Math. 31, No. 1, 542--561 (2017; Zbl 1370.68225) Full Text: DOI
Golovach, Petr A.; Kamiński, Marcin; Maniatis, Spyridon; Thilikos, Dimitrios M. The parameterized complexity of graph cyclability. (English) Zbl 1358.05077 SIAM J. Discrete Math. 31, No. 1, 511-541 (2017). MSC: 05C10 05C38 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 31, No. 1, 511--541 (2017; Zbl 1358.05077) Full Text: DOI arXiv
Felsner, Stefan; Mustaţă, Irina; Pergel, Martin The complexity of the partial order dimension problem: closing the gap. (English) Zbl 1360.06001 SIAM J. Discrete Math. 31, No. 1, 172-189 (2017). MSC: 06A07 68Q25 06A06 05C62 PDFBibTeX XMLCite \textit{S. Felsner} et al., SIAM J. Discrete Math. 31, No. 1, 172--189 (2017; Zbl 1360.06001) Full Text: DOI arXiv
Brandstädt, Andreas; Mosca, Raffaele Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs. (English) Zbl 1352.05143 SIAM J. Discrete Math. 30, No. 4, 2288-2303 (2016). MSC: 05C69 05C70 05C85 05C22 68Q17 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, SIAM J. Discrete Math. 30, No. 4, 2288--2303 (2016; Zbl 1352.05143) Full Text: DOI
Gutin, Gregory; Jones, Mark; Wahlström, Magnus The mixed Chinese postman problem parameterized by pathwidth and treedepth. (English) Zbl 1351.05100 SIAM J. Discrete Math. 30, No. 4, 2177-2205 (2016). MSC: 05C22 05C45 05C85 68R10 90C35 68Q17 PDFBibTeX XMLCite \textit{G. Gutin} et al., SIAM J. Discrete Math. 30, No. 4, 2177--2205 (2016; Zbl 1351.05100) Full Text: DOI
Jukna, Stasys Tropical complexity, Sidon sets, and dynamic programming. (English) Zbl 1353.68103 SIAM J. Discrete Math. 30, No. 4, 2064-2085 (2016). MSC: 68Q17 05D05 90C39 PDFBibTeX XMLCite \textit{S. Jukna}, SIAM J. Discrete Math. 30, No. 4, 2064--2085 (2016; Zbl 1353.68103) Full Text: DOI
Bereg, Sergey; Holroyd, Alexander E.; Nachmanson, Lev; Pupyrev, Sergey Representing permutations with few moves. (English) Zbl 1347.05002 SIAM J. Discrete Math. 30, No. 4, 1950-1977 (2016). MSC: 05A05 68Q17 05C62 PDFBibTeX XMLCite \textit{S. Bereg} et al., SIAM J. Discrete Math. 30, No. 4, 1950--1977 (2016; Zbl 1347.05002) Full Text: DOI arXiv
Giannopoulou, Archontia C.; Mertzios, George B. New geometric representations and domination problems on tolerance and multitolerance graphs. (English) Zbl 1344.05100 SIAM J. Discrete Math. 30, No. 3, 1685-1725 (2016). MSC: 05C62 05C69 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{A. C. Giannopoulou} and \textit{G. B. Mertzios}, SIAM J. Discrete Math. 30, No. 3, 1685--1725 (2016; Zbl 1344.05100) Full Text: DOI
Baïou, Mourad; Barahona, Francisco Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs. (English) Zbl 1338.05052 SIAM J. Discrete Math. 30, No. 2, 1290-1301 (2016). MSC: 05C10 05C22 05C85 90C27 68Q17 PDFBibTeX XMLCite \textit{M. Baïou} and \textit{F. Barahona}, SIAM J. Discrete Math. 30, No. 2, 1290--1301 (2016; Zbl 1338.05052) Full Text: DOI
Jansen, K.; Land, F.; Land, K. Bounding the running time of algorithms for scheduling and packing problems. (English) Zbl 1336.68100 SIAM J. Discrete Math. 30, No. 1, 343-366 (2016). MSC: 68Q17 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{K. Jansen} et al., SIAM J. Discrete Math. 30, No. 1, 343--366 (2016; Zbl 1336.68100) Full Text: DOI Link
Thapper, Johan; Živný, Stanislav Necessary conditions for tractability of valued CSPs. (English) Zbl 1347.08009 SIAM J. Discrete Math. 29, No. 4, 2361-2384 (2015). MSC: 08A70 68Q25 68Q17 PDFBibTeX XMLCite \textit{J. Thapper} and \textit{S. Živný}, SIAM J. Discrete Math. 29, No. 4, 2361--2384 (2015; Zbl 1347.08009) Full Text: DOI arXiv
Guruswami, Venkatesan; Sachdeva, Sushant; Saket, Rishi Inapproximability of minimum vertex cover on \(k\)-uniform \(k\)-partite hypergraphs. (English) Zbl 1331.68089 SIAM J. Discrete Math. 29, No. 1, 36-58 (2015). MSC: 68Q17 05C65 05C70 PDFBibTeX XMLCite \textit{V. Guruswami} et al., SIAM J. Discrete Math. 29, No. 1, 36--58 (2015; Zbl 1331.68089) Full Text: DOI
Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias Polynomial-time data reduction for the subset interconnection design problem. (English) Zbl 1326.05147 SIAM J. Discrete Math. 29, No. 1, 1-25 (2015). MSC: 05C82 05C65 68Q17 68R10 68W05 PDFBibTeX XMLCite \textit{J. Chen} et al., SIAM J. Discrete Math. 29, No. 1, 1--25 (2015; Zbl 1326.05147) Full Text: DOI Link
Hartung, Sepp; Nichterlein, André NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. (English) Zbl 1330.68114 SIAM J. Discrete Math. 29, No. 4, 1931-1960 (2015). MSC: 68Q25 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} and \textit{A. Nichterlein}, SIAM J. Discrete Math. 29, No. 4, 1931--1960 (2015; Zbl 1330.68114) Full Text: DOI arXiv
Chakrabarty, Deeparnab; Huang, Zhiyi Recognizing coverage functions. (English) Zbl 1329.68280 SIAM J. Discrete Math. 29, No. 3, 1585-1599 (2015). MSC: 68W20 68Q17 68W05 PDFBibTeX XMLCite \textit{D. Chakrabarty} and \textit{Z. Huang}, SIAM J. Discrete Math. 29, No. 3, 1585--1599 (2015; Zbl 1329.68280) Full Text: DOI Link
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe Hadwiger number of graphs with small chordality. (English) Zbl 1327.05322 SIAM J. Discrete Math. 29, No. 3, 1427-1451 (2015). MSC: 05C85 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 3, 1427--1451 (2015; Zbl 1327.05322) Full Text: DOI arXiv
Martin, Barnaby; Madelaine, Florent; Stacho, Juraj Constraint satisfaction with counting quantifiers. (English) Zbl 1392.68206 SIAM J. Discrete Math. 29, No. 2, 1065-1113 (2015). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{B. Martin} et al., SIAM J. Discrete Math. 29, No. 2, 1065--1113 (2015; Zbl 1392.68206) Full Text: DOI Link
van Bevern, René; Bredereck, Robert; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Network-based vertex dissolution. (English) Zbl 1327.68139 SIAM J. Discrete Math. 29, No. 2, 888-914 (2015). MSC: 68Q25 05C21 05C90 68Q17 90B10 91F10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., SIAM J. Discrete Math. 29, No. 2, 888--914 (2015; Zbl 1327.68139) Full Text: DOI arXiv
Montgomery, Richard Almost all friendly matrices have many obstructions. (English) Zbl 1311.05165 SIAM J. Discrete Math. 29, No. 1, 421-430 (2015). MSC: 05C70 05C15 68R10 68Q17 PDFBibTeX XMLCite \textit{R. Montgomery}, SIAM J. Discrete Math. 29, No. 1, 421--430 (2015; Zbl 1311.05165) Full Text: DOI arXiv
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in claw-free graphs. (English) Zbl 1311.05090 SIAM J. Discrete Math. 29, No. 1, 348-375 (2015). MSC: 05C38 05C85 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 1, 348--375 (2015; Zbl 1311.05090) Full Text: DOI arXiv Link
Huber, Anna; Krokhin, Andrei Oracle tractability of skew bisubmodular functions. (English) Zbl 1309.68095 SIAM J. Discrete Math. 28, No. 4, 1828-1837 (2014). MSC: 68Q25 68Q17 90C27 90C60 PDFBibTeX XMLCite \textit{A. Huber} and \textit{A. Krokhin}, SIAM J. Discrete Math. 28, No. 4, 1828--1837 (2014; Zbl 1309.68095) Full Text: DOI arXiv Link
Alcón, Liliana; Gutierrez, Marisa; Hurlbert, Glenn Pebbling in split graphs. (English) Zbl 1305.05215 SIAM J. Discrete Math. 28, No. 3, 1449-1466 (2014). MSC: 05C85 05C12 68Q17 90C35 PDFBibTeX XMLCite \textit{L. Alcón} et al., SIAM J. Discrete Math. 28, No. 3, 1449--1466 (2014; Zbl 1305.05215) Full Text: DOI arXiv Link
Nasre, Meghana Popular matchings: structure and strategic issues. (English) Zbl 1319.05107 SIAM J. Discrete Math. 28, No. 3, 1423-1448 (2014). Reviewer: Stephan Wagner (Stellenbosch) MSC: 05C70 90C27 68Q17 PDFBibTeX XMLCite \textit{M. Nasre}, SIAM J. Discrete Math. 28, No. 3, 1423--1448 (2014; Zbl 1319.05107) Full Text: DOI Link
Fomin, Fedor V.; Golovach, Petr A. Long circuits and large Euler subgraphs. (English) Zbl 1298.05300 SIAM J. Discrete Math. 28, No. 2, 878-892 (2014). MSC: 05C85 05C60 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, SIAM J. Discrete Math. 28, No. 2, 878--892 (2014; Zbl 1298.05300) Full Text: DOI arXiv
Benjamini, Itai; Shinkar, Igor; Tsur, Gilad Acquaintance time of a graph. (English) Zbl 1304.68058 SIAM J. Discrete Math. 28, No. 2, 767-785 (2014). MSC: 68Q17 05C85 68R10 91D30 PDFBibTeX XMLCite \textit{I. Benjamini} et al., SIAM J. Discrete Math. 28, No. 2, 767--785 (2014; Zbl 1304.68058) Full Text: DOI arXiv
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan Kernelization lower bounds by cross-composition. (English) Zbl 1295.05222 SIAM J. Discrete Math. 28, No. 1, 277-305 (2014). MSC: 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., SIAM J. Discrete Math. 28, No. 1, 277--305 (2014; Zbl 1295.05222) Full Text: DOI arXiv
Cunha, Luís Felipe I.; Kowada, Luis Antonio B.; Hausen, Rodrigo de A.; de Figueiredo, Celina M. H. Advancing the transposition distance and diameter through lonely permutations. (English) Zbl 1307.05002 SIAM J. Discrete Math. 27, No. 4, 1682-1709 (2013). MSC: 05A05 05E18 05C90 68P10 68R15 68Q17 92D15 92D20 PDFBibTeX XMLCite \textit{L. F. I. Cunha} et al., SIAM J. Discrete Math. 27, No. 4, 1682--1709 (2013; Zbl 1307.05002) Full Text: DOI
Fujita, Ryo; Kobayashi, Yusuke; Makino, Kazuhisa Robust matchings and matroid intersections. (English) Zbl 1285.05136 SIAM J. Discrete Math. 27, No. 3, 1234-1256 (2013). Reviewer: Andreas Brandstädt (Rostock) MSC: 05C69 05B35 05C70 05C85 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{R. Fujita} et al., SIAM J. Discrete Math. 27, No. 3, 1234--1256 (2013; Zbl 1285.05136) Full Text: DOI
Scheidweiler, Robert; Triesch, Eberhard A lower bound for the complexity of monotone graph properties. (English) Zbl 1267.68169 SIAM J. Discrete Math. 27, No. 1, 257-265 (2013). MSC: 68R10 05C25 05C99 68Q17 PDFBibTeX XMLCite \textit{R. Scheidweiler} and \textit{E. Triesch}, SIAM J. Discrete Math. 27, No. 1, 257--265 (2013; Zbl 1267.68169) Full Text: DOI
Boyd, Sylvia; Haghighi, Maryam Mixed and circular multichromosomal genomic median problem. (English) Zbl 1274.92037 SIAM J. Discrete Math. 27, No. 1, 63-74 (2013). MSC: 92D10 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Boyd} and \textit{M. Haghighi}, SIAM J. Discrete Math. 27, No. 1, 63--74 (2013; Zbl 1274.92037) Full Text: DOI
Cusack, Charles A.; Lewis, Timothy; Simpson, Daniel; Taggart, Samuel The complexity of pebbling in diameter two graphs. (English) Zbl 1258.68066 SIAM J. Discrete Math. 26, No. 3, 919-928 (2012). MSC: 68Q17 68R05 68R10 PDFBibTeX XMLCite \textit{C. A. Cusack} et al., SIAM J. Discrete Math. 26, No. 3, 919--928 (2012; Zbl 1258.68066) Full Text: DOI
Bhattacharyya, Arnab; Grigorescu, Elena; Jha, Madhav; Jung, Kyomin; Raskhodnikova, Sofya; Woodruff, David P. Lower bounds for local monotonicity reconstruction from transitive-closure spanners. (English) Zbl 1248.05075 SIAM J. Discrete Math. 26, No. 2, 618-646 (2012). MSC: 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{A. Bhattacharyya} et al., SIAM J. Discrete Math. 26, No. 2, 618--646 (2012; Zbl 1248.05075) Full Text: DOI Link
Bodirsky, Manuel; Chen, Hubie; Feder, Tomás On the complexity of MMSNP. (English) Zbl 1280.68106 SIAM J. Discrete Math. 26, No. 1, 404-414 (2012). MSC: 68Q19 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., SIAM J. Discrete Math. 26, No. 1, 404--414 (2012; Zbl 1280.68106) Full Text: DOI
Dürr, Christoph; Guiñez, Flavio; Matamala, Martin Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography. (English) Zbl 1244.68035 SIAM J. Discrete Math. 26, No. 1, 330-352 (2012). MSC: 68Q17 52C45 05B45 05C70 PDFBibTeX XMLCite \textit{C. Dürr} et al., SIAM J. Discrete Math. 26, No. 1, 330--352 (2012; Zbl 1244.68035) Full Text: DOI
Cabello, Sergio; Colin de Verdière, Éric; Lazarus, Francis Finding cycles with topological properties in embedded graphs. (English) Zbl 1237.05112 SIAM J. Discrete Math. 25, No. 4, 1600-1614 (2011). MSC: 05C38 05C10 05C85 57M15 68Q17 68R10 68W05 PDFBibTeX XMLCite \textit{S. Cabello} et al., SIAM J. Discrete Math. 25, No. 4, 1600--1614 (2011; Zbl 1237.05112) Full Text: DOI
Gonen, Mira; Ron, Dana; Shavitt, Yuval Counting stars and other small subgraphs in sublinear-time. (English) Zbl 1234.68138 SIAM J. Discrete Math. 25, No. 3, 1365-1411 (2011). MSC: 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Gonen} et al., SIAM J. Discrete Math. 25, No. 3, 1365--1411 (2011; Zbl 1234.68138) Full Text: DOI
Epstein, Leah; Levin, Asaf; Mestre, Julián; Segev, Danny Improved approximation guarantees for weighted matching in the semi-streaming model. (English) Zbl 1237.05163 SIAM J. Discrete Math. 25, No. 3, 1251-1265 (2011). MSC: 05C70 68W25 68W27 68W40 68Q17 PDFBibTeX XMLCite \textit{L. Epstein} et al., SIAM J. Discrete Math. 25, No. 3, 1251--1265 (2011; Zbl 1237.05163) Full Text: DOI Link
Richerby, David; Thilikos, Dimitrios M. Searching for a visible, lazy fugitive. (English) Zbl 1294.05115 SIAM J. Discrete Math. 25, No. 2, 497-513 (2011). MSC: 05C57 05C83 05C85 68Q17 68R10 91A24 PDFBibTeX XMLCite \textit{D. Richerby} and \textit{D. M. Thilikos}, SIAM J. Discrete Math. 25, No. 2, 497--513 (2011; Zbl 1294.05115) Full Text: DOI Link
Hausen, Rodrigo de A.; Faria, Luerbio; de Figueiredo, Celina M. H.; Kowada, Luis Antonio B. Unitary toric classes, the reality and desire diagram, and sorting by transpositions. (English) Zbl 1227.05018 SIAM J. Discrete Math. 24, No. 3, 792-807 (2010). MSC: 05A05 05E18 68P10 68R15 68Q17 92D15 92D20 PDFBibTeX XMLCite \textit{R. de A. Hausen} et al., SIAM J. Discrete Math. 24, No. 3, 792--807 (2010; Zbl 1227.05018) Full Text: DOI
Pak, Igor; Vallejo, Ernesto Reductions of Young tableau bijections. (English) Zbl 1229.05282 SIAM J. Discrete Math. 24, No. 1, 113-145 (2010). MSC: 05E10 68Q17 68R05 PDFBibTeX XMLCite \textit{I. Pak} and \textit{E. Vallejo}, SIAM J. Discrete Math. 24, No. 1, 113--145 (2010; Zbl 1229.05282) Full Text: DOI arXiv
Chen, Ning On the approximability of influence in social networks. (English) Zbl 1203.68314 SIAM J. Discrete Math. 23, No. 3, 1400-1415 (2009). MSC: 68W25 68Q17 91D30 PDFBibTeX XMLCite \textit{N. Chen}, SIAM J. Discrete Math. 23, No. 3, 1400--1415 (2009; Zbl 1203.68314) Full Text: DOI
Ásgeirsson, Eyjólfur Ingi; Stein, Cliff Divide-and-conquer approximation algorithm for vertex cover. (English) Zbl 1210.68137 SIAM J. Discrete Math. 23, No. 3, 1261-1280 (2009). MSC: 68W25 05C85 68Q17 PDFBibTeX XMLCite \textit{E. I. Ásgeirsson} and \textit{C. Stein}, SIAM J. Discrete Math. 23, No. 3, 1261--1280 (2009; Zbl 1210.68137) Full Text: DOI
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan Clique-width is NP-complete. (English) Zbl 1207.68159 SIAM J. Discrete Math. 23, No. 2, 909-939 (2009). MSC: 68Q17 05C75 68Q42 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., SIAM J. Discrete Math. 23, No. 2, 909--939 (2009; Zbl 1207.68159) Full Text: DOI Link
Epstein, Leah; Erlebach, Thomas; Levin, Asaf Online capacitated interval coloring. (English) Zbl 1207.68444 SIAM J. Discrete Math. 23, No. 2, 822-841 (2009). MSC: 68W25 68W40 68Q17 PDFBibTeX XMLCite \textit{L. Epstein} et al., SIAM J. Discrete Math. 23, No. 2, 822--841 (2009; Zbl 1207.68444) Full Text: DOI Link
Dvořák, Tomáš; Gregor, Petr Partitions of faulty hypercubes into paths with prescribed endvertices. (English) Zbl 1187.05056 SIAM J. Discrete Math. 22, No. 4, 1448-1461 (2008). MSC: 05C70 05C45 68Q17 68M07 68M15 68R10 PDFBibTeX XMLCite \textit{T. Dvořák} and \textit{P. Gregor}, SIAM J. Discrete Math. 22, No. 4, 1448--1461 (2008; Zbl 1187.05056) Full Text: DOI
Berstein, Yael; Lee, Jon; Maruri-Aguilar, Hugo; Onn, Shmuel; Riccomagno, Eva; Weismantel, Robert; Wynn, Henry Nonlinear matroid optimization and experimental design. (English) Zbl 1198.05024 SIAM J. Discrete Math. 22, No. 3, 901-919 (2008). MSC: 05B35 62H05 62K15 65K10 68Q17 90C10 90C27 PDFBibTeX XMLCite \textit{Y. Berstein} et al., SIAM J. Discrete Math. 22, No. 3, 901--919 (2008; Zbl 1198.05024) Full Text: DOI arXiv
Gupta, Arvind; van den Heuvel, Jan; Maňuch, Ján; Stacho, Ladislav; Zhao, Xiaohong On the complexity of ordered colorings. (English) Zbl 1223.05073 SIAM J. Discrete Math. 22, No. 2, 832-847 (2008). MSC: 05C15 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Gupta} et al., SIAM J. Discrete Math. 22, No. 2, 832--847 (2008; Zbl 1223.05073) Full Text: DOI Link
Alon, Noga; Kaufman, Tali; Krivelevich, Michael; Ron, Dana Testing triangle-freeness in general graphs. (English) Zbl 1163.68018 SIAM J. Discrete Math. 22, No. 2, 786-819 (2008). MSC: 68Q25 05C25 05C85 68Q17 68R10 68W20 68W25 68W40 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 22, No. 2, 786--819 (2008; Zbl 1163.68018) Full Text: DOI
Mayhew, Dillon Matroid complexity and nonsuccinct descriptions. (English) Zbl 1167.05304 SIAM J. Discrete Math. 22, No. 2, 455-466 (2008). MSC: 05B35 68Q17 PDFBibTeX XMLCite \textit{D. Mayhew}, SIAM J. Discrete Math. 22, No. 2, 455--466 (2008; Zbl 1167.05304) Full Text: DOI arXiv Link
Dror, Moshe; Orlin, James B. Combinatorial optimization with explicit delineation of the ground set by a collection of subsets. (English) Zbl 1158.68011 SIAM J. Discrete Math. 21, No. 4, 1019-1034 (2007). MSC: 68Q17 68Q25 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{M. Dror} and \textit{J. B. Orlin}, SIAM J. Discrete Math. 21, No. 4, 1019--1034 (2007; Zbl 1158.68011) Full Text: DOI Link