Frati, Fabrizio Planar rectilinear drawings of outerplanar graphs in linear time. (English) Zbl 07505560 Comput. Geom. 103, Article ID 101854, 52 p. (2022). MSC: 05C62 05C10 05C85 PDF BibTeX XML Cite \textit{F. Frati}, Comput. Geom. 103, Article ID 101854, 52 p. (2022; Zbl 07505560) Full Text: DOI OpenURL
Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann Medians in median graphs and their cube complexes in linear time. (English) Zbl 1483.68250 J. Comput. Syst. Sci. 126, 80-105 (2022). MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{L. Bénéteau} et al., J. Comput. Syst. Sci. 126, 80--105 (2022; Zbl 1483.68250) Full Text: DOI OpenURL
Rana, Sohel; Nayeem, Sk. Md. Abu A linear time algorithm for minimum equitable dominating set in trees. (English) Zbl 1482.05323 Proyecciones 40, No. 4, 805-814 (2021). MSC: 05C85 05C05 05C69 68Q25 PDF BibTeX XML Cite \textit{S. Rana} and \textit{Sk. Md. A. Nayeem}, Proyecciones 40, No. 4, 805--814 (2021; Zbl 1482.05323) Full Text: DOI OpenURL
Chakraborty, Bidesh; Dalui, Mamata; Sikdar, Biplab K. Synthesis of scalable single length cycle, single attractor cellular automata in linear time. (English) Zbl 1474.68198 Complex Syst. 30, No. 3, 415-439 (2021). MSC: 68Q80 37B15 68Q25 68W35 94C11 PDF BibTeX XML Cite \textit{B. Chakraborty} et al., Complex Syst. 30, No. 3, 415--439 (2021; Zbl 1474.68198) Full Text: Link OpenURL
Gurski, Frank; Komander, Dominique; Lindemann, Marvin Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs. (English) Zbl 07405961 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 182-194 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{F. Gurski} et al., Lect. Notes Comput. Sci. 12635, 182--194 (2021; Zbl 07405961) Full Text: DOI OpenURL
Das, Bireswar; Sharma, Shivdutt Nearly linear time isomorphism algorithms for some nonabelian group classes. (English) Zbl 07377740 Theory Comput. Syst. 65, No. 3, 497-514 (2021). MSC: 20-04 68Qxx 20Fxx 68Wxx PDF BibTeX XML Cite \textit{B. Das} and \textit{S. Sharma}, Theory Comput. Syst. 65, No. 3, 497--514 (2021; Zbl 07377740) Full Text: DOI OpenURL
Kawarabayashi, Ken-ichi; Klavík, Pavel; Mohar, Bojan; Nedela, Roman; Zeman, Peter Isomorphisms of maps on the sphere. (English) Zbl 1468.05187 Cunningham, Gabriel (ed.) et al., Polytopes and discrete geometry. AMS special session, Northeastern University, Boston, MA, USA, April 21–22, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 764, 125-147 (2021). MSC: 05C60 05C85 05C10 52B10 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} et al., Contemp. Math. 764, 125--147 (2021; Zbl 1468.05187) Full Text: DOI OpenURL
Liang, Zuosong; Dong, Yanxia; Zhao, Yancai; Xing, Huiyu Equitable clique-coloring in claw-free graphs with maximum degree at most 4. (English) Zbl 1464.05155 Graphs Comb. 37, No. 2, 445-454 (2021). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C15 05C69 05C85 PDF BibTeX XML Cite \textit{Z. Liang} et al., Graphs Comb. 37, No. 2, 445--454 (2021; Zbl 1464.05155) Full Text: DOI OpenURL
Niu, Bei; Li, Bi; Zhang, Xin Hardness and algorithms of equitable tree-coloring problem in chordal graphs. (English) Zbl 1477.68242 Theor. Comput. Sci. 857, 8-15 (2021). MSC: 68R10 05C05 05C15 68Q17 68W25 PDF BibTeX XML Cite \textit{B. Niu} et al., Theor. Comput. Sci. 857, 8--15 (2021; Zbl 1477.68242) Full Text: DOI OpenURL
Janssen, Remie; Murakami, Yukihiro On cherry-picking and network containment. (English) Zbl 1478.92134 Theor. Comput. Sci. 856, 121-150 (2021). MSC: 92D15 PDF BibTeX XML Cite \textit{R. Janssen} and \textit{Y. Murakami}, Theor. Comput. Sci. 856, 121--150 (2021; Zbl 1478.92134) Full Text: DOI arXiv OpenURL
Jha, Anupriya Secure total domination in chain graphs and cographs. (English) Zbl 1471.05083 AKCE Int. J. Graphs Comb. 17, No. 3, 826-832 (2020). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{A. Jha}, AKCE Int. J. Graphs Comb. 17, No. 3, 826--832 (2020; Zbl 1471.05083) Full Text: DOI OpenURL
Yang, Boting; Akter, Tanzina Computing the one-visibility copnumber of trees. (English) Zbl 1482.05325 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 411-423 (2020). MSC: 05C85 05C05 PDF BibTeX XML Cite \textit{B. Yang} and \textit{T. Akter}, Lect. Notes Comput. Sci. 12290, 411--423 (2020; Zbl 1482.05325) Full Text: DOI OpenURL
Niu, Bei; Li, Bi; Zhang, Xin Complexity of tree-coloring interval graphs equitably. (English) Zbl 1482.68183 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 391-398 (2020). MSC: 68R10 05C15 05C62 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{B. Niu} et al., Lect. Notes Comput. Sci. 12290, 391--398 (2020; Zbl 1482.68183) Full Text: DOI arXiv OpenURL
Jiang, Rujun; Li, Duan A linear-time algorithm for generalized trust region subproblems. (English) Zbl 1461.90086 SIAM J. Optim. 30, No. 1, 915-932 (2020). MSC: 90C20 90C22 90C26 68W25 PDF BibTeX XML Cite \textit{R. Jiang} and \textit{D. Li}, SIAM J. Optim. 30, No. 1, 915--932 (2020; Zbl 1461.90086) Full Text: DOI arXiv OpenURL
Jansen, Klaus; Lassota, Alexandra; Rohwedder, Lars Near-linear time algorithm for \(n\)-fold ILPs via color coding. (English) Zbl 1462.68232 SIAM J. Discrete Math. 34, No. 4, 2282-2299 (2020). MSC: 68W05 68W40 90C10 PDF BibTeX XML Cite \textit{K. Jansen} et al., SIAM J. Discrete Math. 34, No. 4, 2282--2299 (2020; Zbl 1462.68232) Full Text: DOI arXiv OpenURL
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf The power of linear-time data reduction for maximum matching. (English) Zbl 07272772 Algorithmica 82, No. 12, 3521-3565 (2020). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{G. B. Mertzios} et al., Algorithmica 82, No. 12, 3521--3565 (2020; Zbl 07272772) Full Text: DOI arXiv OpenURL
Yuster, Raphael A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families. (English) Zbl 1455.68151 Theor. Comput. Sci. 842, 74-85 (2020). MSC: 68R10 05C38 05C83 05C85 68W20 68W40 PDF BibTeX XML Cite \textit{R. Yuster}, Theor. Comput. Sci. 842, 74--85 (2020; Zbl 1455.68151) Full Text: DOI arXiv OpenURL
Dragan, Feodor F.; Guarnera, Heather M. Eccentricity function in distance-hereditary graphs. (English) Zbl 1453.05026 Theor. Comput. Sci. 833, 26-40 (2020). MSC: 05C12 05C85 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, Theor. Comput. Sci. 833, 26--40 (2020; Zbl 1453.05026) Full Text: DOI arXiv OpenURL
Damaschke, Peter Dividing splittable goods evenly and with limited fragmentation. (English) Zbl 1436.05028 Algorithmica 82, No. 5, 1298-1328 (2020). MSC: 05C05 05C22 05C85 68P10 68Q27 68W25 68W40 91B32 PDF BibTeX XML Cite \textit{P. Damaschke}, Algorithmica 82, No. 5, 1298--1328 (2020; Zbl 1436.05028) Full Text: DOI OpenURL
Ayala, Alan; Claeys, Xavier; Grigori, Laura Linear-time CUR approximation of BEM matrices. (English) Zbl 1431.65022 J. Comput. Appl. Math. 368, Article ID 112528, 19 p. (2020). MSC: 65F05 65F25 65F55 65N38 PDF BibTeX XML Cite \textit{A. Ayala} et al., J. Comput. Appl. Math. 368, Article ID 112528, 19 p. (2020; Zbl 1431.65022) Full Text: DOI Link OpenURL
Cheng, Changjie; Lu, Changhong; Zhou, Yu The \(k\)-power domination problem in weighted trees. (English) Zbl 1436.05107 Theor. Comput. Sci. 809, 231-238 (2020). MSC: 05C90 05C05 05C22 05C69 05C85 90C35 PDF BibTeX XML Cite \textit{C. Cheng} et al., Theor. Comput. Sci. 809, 231--238 (2020; Zbl 1436.05107) Full Text: DOI OpenURL
Preißer, Johanna E.; Schmidt, Jens M. Computing vertex-disjoint paths in large graphs using MAOs. (English) Zbl 1436.68256 Algorithmica 82, No. 1, 146-162 (2020). MSC: 68R10 05C38 05C40 05C85 68W40 PDF BibTeX XML Cite \textit{J. E. Preißer} and \textit{J. M. Schmidt}, Algorithmica 82, No. 1, 146--162 (2020; Zbl 1436.68256) Full Text: DOI Link OpenURL
Stefanes, Marco A.; Rubert, Diego P.; Soares, José Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. (English) Zbl 1436.68260 Theor. Comput. Sci. 804, 58-71 (2020). MSC: 68R10 05C38 05C70 68W10 68W40 90C27 PDF BibTeX XML Cite \textit{M. A. Stefanes} et al., Theor. Comput. Sci. 804, 58--71 (2020; Zbl 1436.68260) Full Text: DOI OpenURL
Gajser, David Verifying whether one-tape Turing machines run in linear time. (English) Zbl 1436.68106 J. Comput. Syst. Sci. 107, 93-107 (2020). MSC: 68Q04 68Q17 68Q25 PDF BibTeX XML Cite \textit{D. Gajser}, J. Comput. Syst. Sci. 107, 93--107 (2020; Zbl 1436.68106) Full Text: DOI arXiv OpenURL
Dragan, Feodor F. An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. (English) Zbl 1481.05029 Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020). MSC: 05C05 05C85 68Q25 05C12 PDF BibTeX XML Cite \textit{F. F. Dragan}, Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020; Zbl 1481.05029) Full Text: DOI OpenURL
Hinrichsen, Erica G.; Leoni, Valeria A.; Safe, Martín D. Labelled packing functions in graphs. (English) Zbl 1481.05127 Inf. Process. Lett. 154, Article ID 105863, 7 p. (2020). MSC: 05C70 05C85 68Q25 68Q17 PDF BibTeX XML Cite \textit{E. G. Hinrichsen} et al., Inf. Process. Lett. 154, Article ID 105863, 7 p. (2020; Zbl 1481.05127) Full Text: DOI OpenURL
Liang, Zuosong; Shan, Erfang; Xing, Huiyu; Bai, Chunsong A linear-time algorithm for clique-coloring planar graphs. (English) Zbl 1476.05189 Oper. Res. Lett. 47, No. 4, 241-243 (2019). MSC: 05C85 05C15 05C10 05C69 PDF BibTeX XML Cite \textit{Z. Liang} et al., Oper. Res. Lett. 47, No. 4, 241--243 (2019; Zbl 1476.05189) Full Text: DOI OpenURL
Junginger, Kolja; Mantas, Ioannis; Papadopoulou, Evanthia On selecting leaves with disjoint neighborhoods in embedded trees. (English) Zbl 07115815 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 189-200 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{K. Junginger} et al., Lect. Notes Comput. Sci. 11394, 189--200 (2019; Zbl 07115815) Full Text: DOI OpenURL
Dell’Amico, Mauro; Neto, José On \(f\)-domination: polyhedral and algorithmic results. (English) Zbl 1419.05166 Math. Methods Oper. Res. 90, No. 1, 1-22 (2019). MSC: 05C69 51M20 68Q25 90C10 PDF BibTeX XML Cite \textit{M. Dell'Amico} and \textit{J. Neto}, Math. Methods Oper. Res. 90, No. 1, 1--22 (2019; Zbl 1419.05166) Full Text: DOI OpenURL
Brandt, Sebastian; Wattenhofer, Roger Approximating small balanced vertex separators in almost linear time. (English) Zbl 1430.68181 Algorithmica 81, No. 10, 4070-4097 (2019). MSC: 68R10 68W20 68W40 PDF BibTeX XML Cite \textit{S. Brandt} and \textit{R. Wattenhofer}, Algorithmica 81, No. 10, 4070--4097 (2019; Zbl 1430.68181) Full Text: DOI OpenURL
Gärtner, Fabian; Stadler, Peter F. Direct superbubble detection. (English) Zbl 1461.68152 Algorithms (Basel) 12, No. 4, Paper No. 81, 24 p. (2019). MSC: 68R10 05C20 05C85 68W40 PDF BibTeX XML Cite \textit{F. Gärtner} and \textit{P. F. Stadler}, Algorithms (Basel) 12, No. 4, Paper No. 81, 24 p. (2019; Zbl 1461.68152) Full Text: DOI OpenURL
Bento, Lucila M. S.; Boccardo, Davidson R.; Machado, Raphael C. S.; Pereira de Sá, Vinícius G.; Szwarcfiter, Jayme L. Full characterization of a class of graphs tailored for software watermarking. (English) Zbl 1421.68107 Algorithmica 81, No. 7, 2899-2916 (2019). MSC: 68R10 68N99 68P25 68W40 94A62 PDF BibTeX XML Cite \textit{L. M. S. Bento} et al., Algorithmica 81, No. 7, 2899--2916 (2019; Zbl 1421.68107) Full Text: DOI OpenURL
Schlipf, Lena; Schmidt, Jens M. Edge-orders. (English) Zbl 1423.68356 Algorithmica 81, No. 5, 1881-1900 (2019). Reviewer: Gunther Schmidt (München) MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{L. Schlipf} and \textit{J. M. Schmidt}, Algorithmica 81, No. 5, 1881--1900 (2019; Zbl 1423.68356) Full Text: DOI arXiv OpenURL
Dell’Amico, Mauro; Neto, José On total \(f\)-domination: polyhedral and algorithmic results. (English) Zbl 1407.05175 Discrete Appl. Math. 258, 97-104 (2019). MSC: 05C69 05C05 05C85 90C39 PDF BibTeX XML Cite \textit{M. Dell'Amico} and \textit{J. Neto}, Discrete Appl. Math. 258, 97--104 (2019; Zbl 1407.05175) Full Text: DOI OpenURL
Schlipf, Lena; Schmidt, Jens M. Simple computation of st-edge- and st-numberings from ear decompositions. (English) Zbl 1451.05232 Inf. Process. Lett. 145, 58-63 (2019). MSC: 05C85 05C30 68R10 68P05 PDF BibTeX XML Cite \textit{L. Schlipf} and \textit{J. M. Schmidt}, Inf. Process. Lett. 145, 58--63 (2019; Zbl 1451.05232) Full Text: DOI OpenURL
Kawarabayashi, Ken-Ichi; Thorup, Mikkel Deterministic edge connectivity in near-linear time. (English) Zbl 1426.68217 J. ACM 66, No. 1, Article No. 4, 50 p. (2019). MSC: 68R10 05C40 05C85 68W40 PDF BibTeX XML Cite \textit{K.-I. Kawarabayashi} and \textit{M. Thorup}, J. ACM 66, No. 1, Article No. 4, 50 p. (2019; Zbl 1426.68217) Full Text: DOI arXiv Link OpenURL
Dyer, Martin; Müller, Haiko Counting independent sets in cocomparability graphs. (English) Zbl 1405.05082 Inf. Process. Lett. 144, 31-36 (2019). MSC: 05C30 05C85 05C69 PDF BibTeX XML Cite \textit{M. Dyer} and \textit{H. Müller}, Inf. Process. Lett. 144, 31--36 (2019; Zbl 1405.05082) Full Text: DOI arXiv Link OpenURL
Korenwein, Viatcheslav; Nichterlein, André; Niedermeier, Rolf; Zschoche, Philipp Data reduction for maximum matching on real-world graphs: theory and experiments. (English) Zbl 07378723 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 53, 13 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{V. Korenwein} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 53, 13 p. (2018; Zbl 07378723) Full Text: DOI arXiv OpenURL
Cazaux, Bastien; Juhel, Samuel; Rivals, Eric Practical lower and upper bounds for the shortest linear superstring. (English) Zbl 07286691 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 18, 14 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{B. Cazaux} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 18, 14 p. (2018; Zbl 07286691) Full Text: DOI OpenURL
Fichte, Johannes K.; Hecher, Markus; Morak, Michael; Woltran, Stefan DynASP2.5: dynamic programming on tree decompositions in action. (English) Zbl 1443.68164 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 17, 13 p. (2018). MSC: 68T20 68N17 68Q27 68W05 90C39 PDF BibTeX XML Cite \textit{J. K. Fichte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 17, 13 p. (2018; Zbl 1443.68164) Full Text: DOI arXiv OpenURL
Louza, Felipe A.; Smyth, W. F.; Manzini, Giovanni; Telles, Guilherme P. Lyndon array construction during Burrows-Wheeler inversion. (English) Zbl 06993617 J. Discrete Algorithms 50, 2-9 (2018). MSC: 68Wxx 05C85 PDF BibTeX XML Cite \textit{F. A. Louza} et al., J. Discrete Algorithms 50, 2--9 (2018; Zbl 06993617) Full Text: DOI arXiv Link OpenURL
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket Linear time parameterized algorithms for Subset Feedback Vertex Set. (English) Zbl 1440.68139 ACM Trans. Algorithms 14, No. 1, Article No. 7, 37 p. (2018). MSC: 68Q27 05C83 05C85 68W20 68W40 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., ACM Trans. Algorithms 14, No. 1, Article No. 7, 37 p. (2018; Zbl 1440.68139) Full Text: DOI OpenURL
Fernandes, Cristina G.; Schmidt, Tina Janne; Taraz, Anusch On minimum bisection and related cut problems in trees and tree-like graphs. (English) Zbl 1401.05067 J. Graph Theory 89, No. 2, 214-245 (2018). MSC: 05C05 05C85 90C27 PDF BibTeX XML Cite \textit{C. G. Fernandes} et al., J. Graph Theory 89, No. 2, 214--245 (2018; Zbl 1401.05067) Full Text: DOI arXiv OpenURL
Araki, Toru; Miyazaki, Hiroka Secure domination in proper interval graphs. (English) Zbl 1394.05085 Discrete Appl. Math. 247, 70-76 (2018). MSC: 05C69 05C85 05C38 PDF BibTeX XML Cite \textit{T. Araki} and \textit{H. Miyazaki}, Discrete Appl. Math. 247, 70--76 (2018; Zbl 1394.05085) Full Text: DOI OpenURL
Etscheid, Michael; Mnich, Matthias Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1396.68056 Algorithmica 80, No. 9, 2574-2615 (2018). MSC: 68Q25 05C85 68R10 PDF BibTeX XML Cite \textit{M. Etscheid} and \textit{M. Mnich}, Algorithmica 80, No. 9, 2574--2615 (2018; Zbl 1396.68056) Full Text: DOI OpenURL
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu Linear-time algorithm for quantum 2SAT. (English) Zbl 1395.68132 Theory Comput. 14, Paper No. 1, 27 p. (2018). MSC: 68Q12 PDF BibTeX XML Cite \textit{I. Arad} et al., Theory Comput. 14, Paper No. 1, 27 p. (2018; Zbl 1395.68132) Full Text: DOI OpenURL
de Macedo Filho, H. B.; de Figueiredo, C. M. H.; Li, Z.; Machado, R. C. S. Using SPQR-trees to speed up recognition algorithms based on 2-cutsets. (English) Zbl 1387.05050 Discrete Appl. Math. 245, 101-108 (2018). MSC: 05C05 05C85 PDF BibTeX XML Cite \textit{H. B. de Macedo Filho} et al., Discrete Appl. Math. 245, 101--108 (2018; Zbl 1387.05050) Full Text: DOI OpenURL
Lin, Min-Sheng Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. (English) Zbl 1382.05034 Discrete Appl. Math. 239, 144-153 (2018). MSC: 05C30 05C69 05C12 05C85 PDF BibTeX XML Cite \textit{M.-S. Lin}, Discrete Appl. Math. 239, 144--153 (2018; Zbl 1382.05034) Full Text: DOI OpenURL
Gao, Pu; Wormald, Nicholas Uniform generation of random graphs with power-law degree sequences. (English) Zbl 1403.05136 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1741-1758 (2018). MSC: 05C80 05C07 05C85 68Q25 PDF BibTeX XML Cite \textit{P. Gao} and \textit{N. Wormald}, in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1741--1758 (2018; Zbl 1403.05136) Full Text: arXiv Link OpenURL
Pradhan, D.; Jha, Anupriya On computing a minimum secure dominating set in block graphs. (English) Zbl 1386.05143 J. Comb. Optim. 35, No. 2, 613-631 (2018). MSC: 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{A. Jha}, J. Comb. Optim. 35, No. 2, 613--631 (2018; Zbl 1386.05143) Full Text: DOI OpenURL
Bohler, Cecilia; Klein, Rolf; Lingas, Andrzej; Liu, Chih-Hung Forest-like abstract Voronoi diagrams in linear time. (English) Zbl 1396.65034 Comput. Geom. 68, 134-145 (2018). Reviewer: Michael M. Pahirya (Mukachevo) MSC: 65D18 68U05 51E24 PDF BibTeX XML Cite \textit{C. Bohler} et al., Comput. Geom. 68, 134--145 (2018; Zbl 1396.65034) Full Text: DOI Link OpenURL
Bento, Lucila M. S.; Boccardo, Davidson R.; Machado, Raphael C. S.; Pereira de Sá, Vinícius G.; Szwarcfiter, Jayme Luiz On the resilience of canonical reducible permutation graphs. (English) Zbl 1376.05064 Discrete Appl. Math. 234, 32-46 (2018). MSC: 05C20 05C99 68R10 68P25 PDF BibTeX XML Cite \textit{L. M. S. Bento} et al., Discrete Appl. Math. 234, 32--46 (2018; Zbl 1376.05064) Full Text: DOI OpenURL
Miyazaki, Shuichi; Okamoto, Kazuya Jointly stable matchings. (English) Zbl 1457.90131 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 56, 12 p. (2017). MSC: 90C27 68Q17 68Q25 68W05 90C60 91B68 PDF BibTeX XML Cite \textit{S. Miyazaki} and \textit{K. Okamoto}, LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 56, 12 p. (2017; Zbl 1457.90131) Full Text: DOI OpenURL
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket A linear-time parameterized algorithm for node unique label cover. (English) Zbl 1442.68288 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 57, 15 p. (2017). MSC: 68W40 05C70 05C78 05C85 68Q27 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 57, 15 p. (2017; Zbl 1442.68288) Full Text: DOI arXiv OpenURL
Kempa, Dominik; Kosolobov, Dmitry LZ-End parsing in linear time. (English) Zbl 1442.68050 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 53, 14 p. (2017). MSC: 68P30 68W40 PDF BibTeX XML Cite \textit{D. Kempa} and \textit{D. Kosolobov}, LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 53, 14 p. (2017; Zbl 1442.68050) Full Text: DOI OpenURL
Bacquey, Nicolas; Grandjean, Etienne; Olive, Frédéric Definability by Horn formulas and linear time on cellular automata. (English) Zbl 1442.68118 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 99, 14 p. (2017). MSC: 68Q80 03B25 68Q25 PDF BibTeX XML Cite \textit{N. Bacquey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 99, 14 p. (2017; Zbl 1442.68118) Full Text: DOI OpenURL
Schlipf, Lena; Schmidt, Jens M. Edge-orders. (English) Zbl 1441.68195 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 75, 14 p. (2017). MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{L. Schlipf} and \textit{J. M. Schmidt}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 75, 14 p. (2017; Zbl 1441.68195) Full Text: DOI OpenURL
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf The power of linear-time data reduction for maximum matching. (English) Zbl 1441.68192 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 46, 14 p. (2017). MSC: 68R10 05C70 05C85 68Q27 68W40 PDF BibTeX XML Cite \textit{G. B. Mertzios} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 46, 14 p. (2017; Zbl 1441.68192) Full Text: DOI OpenURL
Damaschke, Peter Dividing splittable goods evenly and with limited fragmentation. (English) Zbl 1441.05209 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 9, 13 p. (2017). MSC: 05C85 05C05 05C22 68P10 68Q27 68W25 68W40 91B32 PDF BibTeX XML Cite \textit{P. Damaschke}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 9, 13 p. (2017; Zbl 1441.05209) Full Text: DOI OpenURL
Artamonov, Yuriĭ Nikolaevich Using the complete sequences for sorting natural numbers. (Russian. English summary) Zbl 1451.68083 Izv. Irkutsk. Gos. Univ., Ser. Mat. 22, 3-17 (2017). MSC: 68P10 PDF BibTeX XML Cite \textit{Y. N. Artamonov}, Izv. Irkutsk. Gos. Univ., Ser. Mat. 22, 3--17 (2017; Zbl 1451.68083) Full Text: Link OpenURL
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Saitoh, Toshiki; Vyskočil, Tomáš Extending partial representations of interval graphs. (English) Zbl 1371.05190 Algorithmica 78, No. 3, 945-967 (2017). MSC: 05C62 05C05 05C85 PDF BibTeX XML Cite \textit{P. Klavík} et al., Algorithmica 78, No. 3, 945--967 (2017; Zbl 1371.05190) Full Text: DOI arXiv Link OpenURL
Guruganesh, Guru Prashanth; Singla, Sahil Online matroid intersection: beating half for random arrival. (English) Zbl 1418.90227 Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 19th international conference, IPCO 2017, Waterloo, ON, Canada, June 26–28, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10328, 241-253 (2017). MSC: 90C27 PDF BibTeX XML Cite \textit{G. P. Guruganesh} and \textit{S. Singla}, Lect. Notes Comput. Sci. 10328, 241--253 (2017; Zbl 1418.90227) Full Text: DOI arXiv OpenURL
Li, Buyang; Liu, Jun; Xiao, Mingqing A new multigrid method for unconstrained parabolic optimal control problems. (English) Zbl 1370.65032 J. Comput. Appl. Math. 326, 358-373 (2017). MSC: 65K10 49J20 49M25 65Y20 PDF BibTeX XML Cite \textit{B. Li} et al., J. Comput. Appl. Math. 326, 358--373 (2017; Zbl 1370.65032) Full Text: DOI OpenURL
Yu, Ting; Liu, Mengchi A linear time algorithm for maximal clique enumeration in large sparse graphs. (English) Zbl 1416.05146 Inf. Process. Lett. 125, 35-40 (2017). MSC: 05C30 05C69 68Q25 PDF BibTeX XML Cite \textit{T. Yu} and \textit{M. Liu}, Inf. Process. Lett. 125, 35--40 (2017; Zbl 1416.05146) Full Text: DOI OpenURL
Ota, Makoto; Seki, Shinnosuke Rule set design problems for oritatami systems. (English) Zbl 1370.68096 Theor. Comput. Sci. 671, 26-35 (2017). MSC: 68Q05 68Q10 68Q25 68U05 92D20 PDF BibTeX XML Cite \textit{M. Ota} and \textit{S. Seki}, Theor. Comput. Sci. 671, 26--35 (2017; Zbl 1370.68096) Full Text: DOI OpenURL
Varga, Andreas Solving fault diagnosis problems. Linear synthesis techniques. (English) Zbl 1396.93004 Studies in Systems, Decision and Control 84. Cham: Springer (ISBN 978-3-319-51558-8/hbk; 978-3-319-51559-5/ebook). xxviii, 394 p. (2017). Reviewer: Lubomír Bakule (Praha) MSC: 93-02 93A30 93B30 93B40 93B50 93C05 PDF BibTeX XML Cite \textit{A. Varga}, Solving fault diagnosis problems. Linear synthesis techniques. Cham: Springer (2017; Zbl 1396.93004) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{R. van Bevern} et al., Discrete Appl. Math. 220, 134--160 (2017; Zbl 1355.05204) Full Text: DOI arXiv OpenURL
Ihm, Insung; Park, Jung-Heum A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. (English) Zbl 1352.05175 Discrete Appl. Math. 218, 98-112 (2017). MSC: 05C85 05C40 05C70 05C38 05C45 PDF BibTeX XML Cite \textit{I. Ihm} and \textit{J.-H. Park}, Discrete Appl. Math. 218, 98--112 (2017; Zbl 1352.05175) Full Text: DOI OpenURL
Cao, Yixin; Grippo, Luciano N.; Safe, Martín D. Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection. (English) Zbl 1350.05104 Discrete Appl. Math. 216, Part 1, 67-83 (2017). MSC: 05C60 05C85 PDF BibTeX XML Cite \textit{Y. Cao} et al., Discrete Appl. Math. 216, Part 1, 67--83 (2017; Zbl 1350.05104) Full Text: DOI arXiv OpenURL
Louza, Felipe A.; Gog, Simon; Telles, Guilherme P. Optimal suffix sorting and LCP array construction for constant alphabets. (English) Zbl 1393.68046 Inf. Process. Lett. 118, 30-34 (2017). MSC: 68P05 68P10 68W40 PDF BibTeX XML Cite \textit{F. A. Louza} et al., Inf. Process. Lett. 118, 30--34 (2017; Zbl 1393.68046) Full Text: DOI OpenURL
Xiao, Mingyu; Nagamochi, Hiroshi A linear-time algorithm for integral multiterminal flows in trees. (English) Zbl 1398.05206 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 62, 12 p. (2016). MSC: 05C85 05C21 90C35 PDF BibTeX XML Cite \textit{M. Xiao} and \textit{H. Nagamochi}, LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 62, 12 p. (2016; Zbl 1398.05206) Full Text: DOI arXiv OpenURL
Agarwal, Pankaj K.; Fox, Kyle; Pan, Jiangwei; Ying, Rex Approximating dynamic time warping and edit distance for a pair of point sequences. (English) Zbl 1387.68226 Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 6, 16 p. (2016). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{P. K. Agarwal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 6, 16 p. (2016; Zbl 1387.68226) Full Text: DOI arXiv OpenURL
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu Linear time algorithm for quantum 2SAT. (English) Zbl 1388.68064 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 15, 14 p. (2016). MSC: 68Q12 PDF BibTeX XML Cite \textit{I. Arad} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 15, 14 p. (2016; Zbl 1388.68064) Full Text: DOI arXiv OpenURL
Baier, Uwe Linear-time suffix sorting – a new approach for suffix array construction. (English) Zbl 1380.68164 Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 23, 12 p. (2016). MSC: 68P10 68W32 68W40 PDF BibTeX XML Cite \textit{U. Baier}, LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 23, 12 p. (2016; Zbl 1380.68164) Full Text: DOI OpenURL
Zhang, Jingyuan; Chen, Xufeng; Sun, Weigang A linear-time algorithm for the Hosoya index of an arbitrary tree. (English) Zbl 1461.05076 MATCH Commun. Math. Comput. Chem. 75, No. 3, 703-714 (2016). MSC: 05C09 05C92 92E10 05C85 05C12 PDF BibTeX XML Cite \textit{J. Zhang} et al., MATCH Commun. Math. Comput. Chem. 75, No. 3, 703--714 (2016; Zbl 1461.05076) OpenURL
Murtagh, Fionn; Contreras, Pedro Direct reading algorithm for hierarchical clustering. (English) Zbl 1404.68041 Korpelainen, Nicholas (ed.), TCDM 2016. Proceedings of the 1st IMA conference on theoretical and computational discrete mathematics, University of Derby, Derby, UK, March 22–23, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 56, 37-42 (2016). MSC: 68P99 62H30 68Q25 PDF BibTeX XML Cite \textit{F. Murtagh} and \textit{P. Contreras}, Electron. Notes Discrete Math. 56, 37--42 (2016; Zbl 1404.68041) Full Text: DOI Link OpenURL
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 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, SIAM J. Discrete Math. 30, No. 4, 2288--2303 (2016; Zbl 1352.05143) Full Text: DOI OpenURL
Lafond, Manuel; Narayanan, Lata; Wu, Kangkang Whom to befriend to influence people. (English) Zbl 1446.91050 Suomela, Jukka (ed.), Structural information and communication complexity. 23rd international colloquium, SIROCCO 2016, Helsinki, Finland, July 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9988, 340-357 (2016). MSC: 91D30 68Q17 68W40 PDF BibTeX XML Cite \textit{M. Lafond} et al., Lect. Notes Comput. Sci. 9988, 340--357 (2016; Zbl 1446.91050) Full Text: DOI arXiv OpenURL
Alatabbi, Ali; Daykin, Jacqueline W.; Kärkkäinen, Juha; Sohel Rahman, M.; Smyth, W. F. \(V\)-order: new combinatorial properties & a simple comparison algorithm. (English) Zbl 1346.05004 Discrete Appl. Math. 215, 41-46 (2016). MSC: 05A05 68W27 68R10 68P05 PDF BibTeX XML Cite \textit{A. Alatabbi} et al., Discrete Appl. Math. 215, 41--46 (2016; Zbl 1346.05004) Full Text: DOI OpenURL
Alatabbi, Ali; Sohel Rahman, M.; Smyth, W. F. Computing covers using prefix tables. (English) Zbl 1350.68297 Discrete Appl. Math. 212, 2-9 (2016). MSC: 68W32 PDF BibTeX XML Cite \textit{A. Alatabbi} et al., Discrete Appl. Math. 212, 2--9 (2016; Zbl 1350.68297) Full Text: DOI arXiv OpenURL
Kammer, Frank; Tholey, Torsten Approximate tree decompositions of planar graphs in linear time. (English) Zbl 1348.68296 Theor. Comput. Sci. 645, 60-90 (2016). MSC: 68W25 05C10 05C70 05C85 68Q25 PDF BibTeX XML Cite \textit{F. Kammer} and \textit{T. Tholey}, Theor. Comput. Sci. 645, 60--90 (2016; Zbl 1348.68296) Full Text: DOI OpenURL
Hazan, Elad; Koren, Tomer A linear-time algorithm for trust region problems. (English) Zbl 1346.90654 Math. Program. 158, No. 1-2 (A), 363-381 (2016). MSC: 90C20 90C22 90C26 68W25 PDF BibTeX XML Cite \textit{E. Hazan} and \textit{T. Koren}, Math. Program. 158, No. 1--2 (A), 363--381 (2016; Zbl 1346.90654) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in circular-arc graphs in linear time. (English) Zbl 1345.05051 Theor. Comput. Sci. 640, 70-83 (2016). MSC: 05C38 05C85 68Q25 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 640, 70--83 (2016; Zbl 1345.05051) Full Text: DOI arXiv OpenURL
Eppstein, David Simple recognition of Halin graphs and their generalizations. (English) Zbl 1339.05385 J. Graph Algorithms Appl. 20, No. 2, 323-346 (2016). MSC: 05C85 05C62 PDF BibTeX XML Cite \textit{D. Eppstein}, J. Graph Algorithms Appl. 20, No. 2, 323--346 (2016; Zbl 1339.05385) Full Text: DOI arXiv OpenURL
Quilliot, Alain; Rebaine, Djamal Linear time algorithms to solve the linear ordering problem for oriented tree based graphs. (English) Zbl 1338.90254 RAIRO, Oper. Res. 50, No. 2, 315-325 (2016). MSC: 90C08 PDF BibTeX XML Cite \textit{A. Quilliot} and \textit{D. Rebaine}, RAIRO, Oper. Res. 50, No. 2, 315--325 (2016; Zbl 1338.90254) Full Text: DOI OpenURL
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon A linear time algorithm for metric dimension of cactus block graphs. (English) Zbl 1339.05388 Theor. Comput. Sci. 630, 43-62 (2016). MSC: 05C85 05C12 05B05 PDF BibTeX XML Cite \textit{S. Hoffmann} et al., Theor. Comput. Sci. 630, 43--62 (2016; Zbl 1339.05388) Full Text: DOI OpenURL
Bhattacharya, Binay; Das, Sandip; Kameda, Tsunehiko Linear-time fitting of a \(k\)-step function. (English) Zbl 1437.68182 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 85-96 (2016). MSC: 68U05 68W40 PDF BibTeX XML Cite \textit{B. Bhattacharya} et al., Lect. Notes Comput. Sci. 9602, 85--96 (2016; Zbl 1437.68182) Full Text: DOI arXiv OpenURL
Har-Peled, Sariel; Raichel, Benjamin Net and prune: a linear time algorithm for Euclidean distance problems. (English) Zbl 1426.68273 J. ACM 62, No. 6, Article No. 44, 35 p. (2015). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{S. Har-Peled} and \textit{B. Raichel}, J. ACM 62, No. 6, Article No. 44, 35 p. (2015; Zbl 1426.68273) Full Text: DOI arXiv OpenURL
Chiplunkar, Ashish; Vishwanathan, Sundar Approximating the regular graphic TSP in near linear time. (English) Zbl 1366.68365 Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 125-135 (2015). MSC: 68W25 68W20 68W40 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{A. Chiplunkar} and \textit{S. Vishwanathan}, LIPIcs -- Leibniz Int. Proc. Inform. 45, 125--135 (2015; Zbl 1366.68365) Full Text: DOI arXiv OpenURL
Benner, Peter; Breiten, Tobias; Feng, Lihong Matrix equations and model reduction. (English) Zbl 1332.65083 Bai, Zhaojun (ed.) et al., Matrix functions and matrix equations. Lectures of the 4th Gene Golub summer school, Shanghai, China, July 22 – August 2, 2013. Hackensack, NJ: World Scientific; Beijing: Higher Education Press (ISBN 978-981-4675-76-5/hbk; 978-981-4675-78-9/ebook). Series in Contemporary Applied Mathematics CAM 19, 50-75 (2015). MSC: 65K10 93C05 65F30 15A24 PDF BibTeX XML Cite \textit{P. Benner} et al., Ser. Contemp. Appl. Math. CAM 19, 50--75 (2015; Zbl 1332.65083) Full Text: DOI Link OpenURL
Han, Yijie A linear time algorithm for ordered partition. (English) Zbl 1407.68120 Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9130, 89-103 (2015). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{Y. Han}, Lect. Notes Comput. Sci. 9130, 89--103 (2015; Zbl 1407.68120) Full Text: DOI OpenURL
Buchbinder, Niv; Feldman, Moran; Seffi, Joseph; Schwartz, Roy A tight linear time (1/2)-approximation for unconstrained submodular maximization. (English) Zbl 1330.68346 SIAM J. Comput. 44, No. 5, 1384-1402 (2015). MSC: 68W25 68W20 90C27 PDF BibTeX XML Cite \textit{N. Buchbinder} et al., SIAM J. Comput. 44, No. 5, 1384--1402 (2015; Zbl 1330.68346) Full Text: DOI OpenURL
Farach-Colton, Martín; Hsu, Tsan-sheng; Li, Meng; Tsai, Meng-Tsung Finding articulation points of large graphs in linear time. (English) Zbl 1451.68201 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 363-372 (2015). MSC: 68R10 68Q17 68W27 68W40 PDF BibTeX XML Cite \textit{M. Farach-Colton} et al., Lect. Notes Comput. Sci. 9214, 363--372 (2015; Zbl 1451.68201) Full Text: DOI OpenURL
Alam, Jawaherul; Evans, William; Kobourov, Stephen; Pupyrev, Sergey; Toeniskoetter, Jackson; Ueckerdt, Torsten Contact representations of graphs in 3D. (English) Zbl 1444.68130 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 14-27 (2015). MSC: 68R10 05C62 05C85 68U05 68W40 PDF BibTeX XML Cite \textit{J. Alam} et al., Lect. Notes Comput. Sci. 9214, 14--27 (2015; Zbl 1444.68130) Full Text: DOI arXiv OpenURL
Pettie, Seth Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. (English) Zbl 1323.05123 J. Graph Algorithms Appl. 19, No. 1, 375-391 (2015). MSC: 05C85 05C05 68W20 PDF BibTeX XML Cite \textit{S. Pettie}, J. Graph Algorithms Appl. 19, No. 1, 375--391 (2015; Zbl 1323.05123) Full Text: DOI OpenURL
Li, Lvzhou; Feng, Yuan Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties. (English) Zbl 1329.68119 Inf. Comput. 244, 229-244 (2015). MSC: 68Q12 68Q05 68Q60 81P68 PDF BibTeX XML Cite \textit{L. Li} and \textit{Y. Feng}, Inf. Comput. 244, 229--244 (2015; Zbl 1329.68119) Full Text: DOI arXiv OpenURL
Chiarelli, Nina; Milanič, Martin On a class of graphs between threshold and total domishold graphs. (English) Zbl 1320.05087 Discrete Appl. Math. 195, 43-58 (2015). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{N. Chiarelli} and \textit{M. Milanič}, Discrete Appl. Math. 195, 43--58 (2015; Zbl 1320.05087) Full Text: DOI OpenURL
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu Interval graph representation with given interval and intersection lengths. (English) Zbl 1336.05134 J. Discrete Algorithms 34, 108-117 (2015). MSC: 05C85 05C62 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. Köbler} et al., J. Discrete Algorithms 34, 108--117 (2015; Zbl 1336.05134) Full Text: DOI OpenURL
Kawarabayashi, Ken-ichi; Thorup, Mikkel Deterministic global minimum cut of a simple graph in near-linear time. (English) Zbl 1321.05268 Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 665-674 (2015). MSC: 05C85 05C40 05C70 68Q25 68R10 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} and \textit{M. Thorup}, in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 665--674 (2015; Zbl 1321.05268) Full Text: DOI OpenURL
Kammer, Frank A linear-time kernelization for the rooted \(k\)-leaf outbranching problem. (English) Zbl 1317.05072 Discrete Appl. Math. 193, 126-138 (2015). MSC: 05C20 05C05 05C69 68Q25 PDF BibTeX XML Cite \textit{F. Kammer}, Discrete Appl. Math. 193, 126--138 (2015; Zbl 1317.05072) Full Text: DOI OpenURL