Bergé, Pierre; Ducoffe, Guillaume; Habib, Michel Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. (English) Zbl 07802707 Theory Comput. Syst. 68, No. 1, 144-193 (2024). MSC: 05C42 05C12 68W25 68R10 PDFBibTeX XMLCite \textit{P. Bergé} et al., Theory Comput. Syst. 68, No. 1, 144--193 (2024; Zbl 07802707) Full Text: DOI arXiv
Dumitrescu, Adrian; Lingas, Andrzej Finding small complete subgraphs efficiently. (English) Zbl 07781735 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 185-196 (2023). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Dumitrescu} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 13889, 185--196 (2023; Zbl 07781735) Full Text: DOI arXiv
Barik, Sasmita; Reddy, Sane Umesh Number of cycles of small length in a graph. (English) Zbl 1523.05019 AKCE Int. J. Graphs Comb. 20, No. 2, 134-147 (2023). MSC: 05C30 05C50 05C38 PDFBibTeX XMLCite \textit{S. Barik} and \textit{S. U. Reddy}, AKCE Int. J. Graphs Comb. 20, No. 2, 134--147 (2023; Zbl 1523.05019) Full Text: DOI
Gishboliner, Lior; Levanzov, Yevgeny; Shapira, Asaf; Yuster, Raphael Counting homomorphic cycles in degenerate graphs. (English) Zbl 07753153 ACM Trans. Algorithms 19, No. 1, Article No. 2, 22 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{L. Gishboliner} et al., ACM Trans. Algorithms 19, No. 1, Article No. 2, 22 p. (2023; Zbl 07753153) Full Text: DOI arXiv
Emelin, Maxim D.; Khlystov, Ilya A.; Malyshev, Dmitry S.; Razvenskaya, Olga O. On linear algebraic algorithms for the subgraph matching problem and its variants. (English) Zbl 07720213 Optim. Lett. 17, No. 7, 1533-1549 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{M. D. Emelin} et al., Optim. Lett. 17, No. 7, 1533--1549 (2023; Zbl 07720213) Full Text: DOI
Büyükçolak, Yasemin; Özkan, Sibel; Gözüpek, Didem Triangle-free equimatchable graphs. (English) Zbl 1522.05367 J. Graph Theory 99, No. 3, 461-484 (2022). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{Y. Büyükçolak} et al., J. Graph Theory 99, No. 3, 461--484 (2022; Zbl 1522.05367) Full Text: DOI arXiv
Bera, Suman K.; Gishboliner, Lior; Levanzov, Yevgeny; Seshadhri, C.; Shapira, Asaf Counting subgraphs in degenerate graphs. (English) Zbl 07679919 J. ACM 69, No. 3, Paper No. 23, 21 p. (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{S. K. Bera} et al., J. ACM 69, No. 3, Paper No. 23, 21 p. (2022; Zbl 07679919) Full Text: DOI arXiv
An, Haozhe; Gurumukhani, Mohit; Impagliazzo, Russell; Jaber, Michael; Künnemann, Marvin; Parga Nina, Maria Paula The fine-grained complexity of multi-dimensional ordering properties. (English) Zbl 07608287 Algorithmica 84, No. 11, 3156-3191 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{H. An} et al., Algorithmica 84, No. 11, 3156--3191 (2022; Zbl 07608287) Full Text: DOI
Estrada, Ernesto The many facets of the Estrada indices of graphs and networks. (English) Zbl 1484.05046 S\(\vec{\text{e}}\)MA J. 79, No. 1, 57-125 (2022). MSC: 05C09 05C12 05C22 05C35 05C50 05C80 05C82 05C92 15A16 15A42 PDFBibTeX XMLCite \textit{E. Estrada}, S\(\vec{\text{e}}\)MA J. 79, No. 1, 57--125 (2022; Zbl 1484.05046) Full Text: DOI
Lo, On-Hei Solomon Find subtrees of specified weight and cycles of specified length in linear time. (English) Zbl 1522.05241 J. Graph Theory 98, No. 3, 531-552 (2021). MSC: 05C38 05C45 05C10 PDFBibTeX XMLCite \textit{O.-H. S. Lo}, J. Graph Theory 98, No. 3, 531--552 (2021; Zbl 1522.05241) Full Text: DOI arXiv
Caballero, David; Gomez, Timothy; Schweller, Robert; Wylie, Tim The complexity of multiple handed self-assembly. (English) Zbl 07553900 Kostitsyna, Irina et al., Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12984, 1-18 (2021). MSC: 68Q07 68Q09 68Q10 68Q12 PDFBibTeX XMLCite \textit{D. Caballero} et al., Lect. Notes Comput. Sci. 12984, 1--18 (2021; Zbl 07553900) Full Text: DOI
Bhattacharya, Anup; Bishnu, Arijit; Ghosh, Arijit; Mishra, Gopinath On triangle estimation using tripartite independent set queries. (English) Zbl 1508.68259 Theory Comput. Syst. 65, No. 8, 1165-1192 (2021). MSC: 68R10 05C30 05C69 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Bhattacharya} et al., Theory Comput. Syst. 65, No. 8, 1165--1192 (2021; Zbl 1508.68259) Full Text: DOI arXiv Link
Dalirrooyfard, Mina; Vuong, Thuy Duong; Williams, Virginia Vassilevska Graph pattern detection: hardness for all induced patterns and faster noninduced cycles. (English) Zbl 1478.05145 SIAM J. Comput. 50, No. 5, 1627-1662 (2021). MSC: 05C85 05C38 05C60 05C15 03D15 68T10 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Dalirrooyfard} et al., SIAM J. Comput. 50, No. 5, 1627--1662 (2021; Zbl 1478.05145) Full Text: DOI
Williams, R. Ryan From circuit complexity to faster all-pairs shortest paths. (English) Zbl 1470.05139 SIAM Rev. 63, No. 3, 559-582 (2021). MSC: 05C76 05C82 05C85 68Q25 94C05 68W25 PDFBibTeX XMLCite \textit{R. R. Williams}, SIAM Rev. 63, No. 3, 559--582 (2021; Zbl 1470.05139) Full Text: DOI
Yu, Yue; Grazioli, Gianmarc; Phillips, Nolan E.; Butts, Carter T. Local graph stability in exponential family random graph models. (English) Zbl 1469.05154 SIAM J. Appl. Math. 81, No. 4, 1389-1415 (2021). MSC: 05C80 05C75 05C62 68R10 91D30 PDFBibTeX XMLCite \textit{Y. Yu} et al., SIAM J. Appl. Math. 81, No. 4, 1389--1415 (2021; Zbl 1469.05154) Full Text: DOI arXiv
Geerts, Floris On the expressive power of linear algebra on graphs. (English) Zbl 1466.05118 Theory Comput. Syst. 65, No. 1, 179-239 (2021); correction ibid. 65, No. 1, 240 (2021). MSC: 05C50 15A99 68R10 PDFBibTeX XMLCite \textit{F. Geerts}, Theory Comput. Syst. 65, No. 1, 179--239 (2021; Zbl 1466.05118) Full Text: DOI arXiv Backlinks: MO
Feuilloley, Laurent; Habib, Michel Graph classes and forbidden patterns on three vertices. (English) Zbl 1504.05278 SIAM J. Discrete Math. 35, No. 1, 55-90 (2021). MSC: 05C85 05C62 05C75 68R10 PDFBibTeX XMLCite \textit{L. Feuilloley} and \textit{M. Habib}, SIAM J. Discrete Math. 35, No. 1, 55--90 (2021; Zbl 1504.05278) Full Text: DOI arXiv
Dudek, Bartłeomiej; Gawrychowski, Paweł Counting 4-patterns in permutations is equivalent to counting 4-cycles in graphs. (English) Zbl 07765381 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 23, 18 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. Dudek} and \textit{P. Gawrychowski}, LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 23, 18 p. (2020; Zbl 07765381) Full Text: DOI arXiv
Maugis, P.-A. G.; Olhede, S. C.; Priebe, C. E.; Wolfe, P. J. Testing for equivalence of network distribution using subgraph counts. (English) Zbl 07499288 J. Comput. Graph. Stat. 29, No. 3, 455-465 (2020). MSC: 62-XX PDFBibTeX XMLCite \textit{P. A. G. Maugis} et al., J. Comput. Graph. Stat. 29, No. 3, 455--465 (2020; Zbl 07499288) Full Text: DOI
Potechin, Aaron; Shallit, Jeffrey Lengths of words accepted by nondeterministic finite automata. (English) Zbl 1461.68104 Inf. Process. Lett. 162, Article ID 105993, 4 p. (2020). Reviewer: Ludwig Staiger (Halle) MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{A. Potechin} and \textit{J. Shallit}, Inf. Process. Lett. 162, Article ID 105993, 4 p. (2020; Zbl 1461.68104) Full Text: DOI arXiv
Kashyop, Manas Jyoti; Narayanaswamy, N. S. Lazy or eager dynamic matching may not be fast. (English) Zbl 1462.68233 Inf. Process. Lett. 162, Article ID 105982, 3 p. (2020). MSC: 68W05 05C70 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{M. J. Kashyop} and \textit{N. S. Narayanaswamy}, Inf. Process. Lett. 162, Article ID 105982, 3 p. (2020; Zbl 1462.68233) Full Text: DOI
Burkhardt, Paul; Faber, Vance; Harris, David G. Bounds and algorithms for graph trusses. (English) Zbl 1447.05193 J. Graph Algorithms Appl. 24, No. 3, 191-214 (2020). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{P. Burkhardt} et al., J. Graph Algorithms Appl. 24, No. 3, 191--214 (2020; Zbl 1447.05193) Full Text: DOI arXiv
Meda Satish, Suraj Krishna Immersed cycles and the JSJ decomposition. (English) Zbl 1528.20079 Algebr. Geom. Topol. 20, No. 4, 1877-1938 (2020). MSC: 20F67 20E05 20E06 20E08 20F65 57M07 PDFBibTeX XMLCite \textit{S. K. Meda Satish}, Algebr. Geom. Topol. 20, No. 4, 1877--1938 (2020; Zbl 1528.20079) Full Text: DOI arXiv
Page, Daniel R.; Solis-Oba, Roberto; Maack, Marten Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. (English) Zbl 1436.90055 Theor. Comput. Sci. 809, 204-217 (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{D. R. Page} et al., Theor. Comput. Sci. 809, 204--217 (2020; Zbl 1436.90055) Full Text: DOI
Censor-Hillel, Keren; Leitersdorf, Dean; Turner, Elia Sparse matrix multiplication and triangle listing in the congested clique model. (English) Zbl 1447.68015 Theor. Comput. Sci. 809, 45-60 (2020). Reviewer: Dana Petcu (Timişoara) MSC: 68W15 68W40 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Theor. Comput. Sci. 809, 45--60 (2020; Zbl 1447.68015) Full Text: DOI arXiv Link
Bringmann, Karl; Fischer, Nick; Künnemann, Marvin A fine-grained analogue of Schaefer’s theorem in P: dichotomy of \(\exists^k-\forall\)-quantified first-order graph properties. (English) Zbl 07564431 Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 31, 27 p. (2019). MSC: 68Q25 PDFBibTeX XMLCite \textit{K. Bringmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 31, 27 p. (2019; Zbl 07564431) Full Text: DOI
Berkholz, Christoph; Schweikardt, Nicole Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width. (English) Zbl 07561702 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 58, 15 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Berkholz} and \textit{N. Schweikardt}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 58, 15 p. (2019; Zbl 07561702) Full Text: DOI arXiv
Ancona, Bertie; Henzinger, Monika; Roditty, Liam; Williams, Virginia Vassilevska; Wein, Nicole Algorithms and hardness for diameter in dynamic graphs. (English) Zbl 07561506 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 13, 14 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{B. Ancona} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 13, 14 p. (2019; Zbl 07561506) Full Text: DOI arXiv
Geerts, Floris On the expressive power of linear algebra on graphs. (English) Zbl 07561467 Barcelo, Pablo (ed.) et al., 22nd international conference on database theory, ICDT 2019, March 26–28, 2019, Lisbon, Portugal. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 127, Article 7, 19 p. (2019). MSC: 68P15 PDFBibTeX XMLCite \textit{F. Geerts}, LIPIcs -- Leibniz Int. Proc. Inform. 127, Article 7, 19 p. (2019; Zbl 07561467) Full Text: DOI
Kara, Ahmet; Ngo, Hung Q.; Nikolic, Milos; Olteanu, Dan; Zhang, Haozhe Counting triangles under updates in worst-case optimal time. (English) Zbl 07561464 Barcelo, Pablo (ed.) et al., 22nd international conference on database theory, ICDT 2019, March 26–28, 2019, Lisbon, Portugal. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 127, Article 4, 18 p. (2019). MSC: 68P15 PDFBibTeX XMLCite \textit{A. Kara} et al., LIPIcs -- Leibniz Int. Proc. Inform. 127, Article 4, 18 p. (2019; Zbl 07561464) Full Text: DOI arXiv
Austrin, Per; Kaski, Petteri; Kubjas, Kaie Tensor network complexity of multilinear maps. (English) Zbl 07559050 Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 7, 21 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Austrin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 124, Article 7, 21 p. (2019; Zbl 07559050) Full Text: DOI arXiv
Kaplan, Haim; Klost, Katharina; Mulzer, Wolfgang; Roditty, Liam; Seiferth, Paul; Sharir, Micha Triangles and girth in disk graphs and transmission graphs. (English) Zbl 07525501 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 64, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Kaplan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 64, 14 p. (2019; Zbl 07525501) Full Text: DOI arXiv
Bonnet, Édouard; Iwata, Yoichi; Jansen, Bart M. P.; Kowalik, Lukasz Fine-grained complexity of \(k\)-OPT in bounded-degree graphs for solving TSP. (English) Zbl 07525460 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 23, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 23, 14 p. (2019; Zbl 07525460) Full Text: DOI arXiv
Jung, Minsoo; Lim, Yongsub; Lee, Sunmin; Kang, U. FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams. (English) Zbl 1458.68283 Data Min. Knowl. Discov. 33, No. 5, 1225-1253 (2019). MSC: 68W27 68R10 PDFBibTeX XMLCite \textit{M. Jung} et al., Data Min. Knowl. Discov. 33, No. 5, 1225--1253 (2019; Zbl 1458.68283) Full Text: DOI arXiv
Stanić, Zoran Integral regular net-balanced signed graphs with vertex degree at most four. (English) Zbl 1433.05142 Ars Math. Contemp. 17, No. 1, 103-114 (2019). MSC: 05C22 05C50 05C31 PDFBibTeX XMLCite \textit{Z. Stanić}, Ars Math. Contemp. 17, No. 1, 103--114 (2019; Zbl 1433.05142) Full Text: DOI
Censor-Hillel, Keren; Kaski, Petteri; Korhonen, Janne H.; Lenzen, Christoph; Paz, Ami; Suomela, Jukka Algebraic methods in the congested clique. (English) Zbl 1452.68267 Distrib. Comput. 32, No. 6, 461-478 (2019). MSC: 68W15 68R10 68W25 68W30 68W40 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Distrib. Comput. 32, No. 6, 461--478 (2019; Zbl 1452.68267) Full Text: DOI arXiv
Amarilli, Antoine; Bourhis, Pierre; Monet, Mikaël; Senellart, Pierre Evaluating Datalog via tree automata and cycluits. (English) Zbl 1430.68078 Theory Comput. Syst. 63, No. 7, 1620-1678 (2019). MSC: 68P15 68Q27 68Q45 PDFBibTeX XMLCite \textit{A. Amarilli} et al., Theory Comput. Syst. 63, No. 7, 1620--1678 (2019; Zbl 1430.68078) Full Text: DOI arXiv
Sankowski, Piotr; Węgrzycki, Karol Improved distance queries and cycle counting by Frobenius normal form. (English) Zbl 1427.90285 Theory Comput. Syst. 63, No. 5, 1049-1067 (2019). MSC: 90C35 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Sankowski} and \textit{K. Węgrzycki}, Theory Comput. Syst. 63, No. 5, 1049--1067 (2019; Zbl 1427.90285) Full Text: DOI
Miao, Dongjing; Cai, Zhipeng; Yu, Jiguo; Li, Yingshu Triangle edge deletion on planar glasses-free RGB-digraphs. (English) Zbl 1425.68319 Theor. Comput. Sci. 788, 2-11 (2019). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{D. Miao} et al., Theor. Comput. Sci. 788, 2--11 (2019; Zbl 1425.68319) Full Text: DOI
Giscard, Pierre-Louis; Kriege, Nils; Wilson, Richard C. A general purpose algorithm for counting simple cycles and simple paths of any length. (English) Zbl 1423.05171 Algorithmica 81, No. 7, 2716-2737 (2019). MSC: 05C85 05C22 05C30 05C38 05C80 68W40 PDFBibTeX XMLCite \textit{P.-L. Giscard} et al., Algorithmica 81, No. 7, 2716--2737 (2019; Zbl 1423.05171) Full Text: DOI arXiv Link
Khetan, Ashish; Oh, Sewoong Spectrum estimation from a few entries. (English) Zbl 1483.62092 J. Mach. Learn. Res. 20, Paper No. 21, 55 p. (2019). MSC: 62H12 15A83 PDFBibTeX XMLCite \textit{A. Khetan} and \textit{S. Oh}, J. Mach. Learn. Res. 20, Paper No. 21, 55 p. (2019; Zbl 1483.62092) Full Text: arXiv Link
Chanchary, Farah; Maheshwari, Anil Time windowed data structures for graphs. (English) Zbl 1407.05219 J. Graph Algorithms Appl. 23, No. 2, 191-226 (2019). MSC: 05C85 68P05 68R10 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} and \textit{A. Maheshwari}, J. Graph Algorithms Appl. 23, No. 2, 191--226 (2019; Zbl 1407.05219) Full Text: DOI
Björklund, Andreas; Husfeldt, Thore; Kaski, Petteri; Koivisto, Mikko Counting connected subgraphs with maximum-degree-aware sieving. (English) Zbl 07561371 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 17, 12 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{A. Björklund} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 17, 12 p. (2018; Zbl 07561371) Full Text: DOI
Kratsch, Stefan; Nelles, Florian Efficient and adaptive parameterized algorithms on modular decompositions. (English) Zbl 1524.68235 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 55, 15 p. (2018). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{S. Kratsch} and \textit{F. Nelles}, LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 55, 15 p. (2018; Zbl 1524.68235) Full Text: DOI arXiv
Bonnet, Édouard; Giannopoulos, Panos; Kim, Eun Jung; Rzążewski, Paweł; Sikora, Florian QPTAS and subexponential algorithm for maximum clique on disk graphs. (English) Zbl 1489.68342 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 12, 15 p. (2018). MSC: 68U05 05C62 05C69 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 12, 15 p. (2018; Zbl 1489.68342) Full Text: DOI arXiv
Giscard, Pierre-Louis; Rochet, Paul Enumerating simple paths from connected induced subgraphs. (English) Zbl 1402.05104 Graphs Comb. 34, No. 6, 1197-1202 (2018). MSC: 05C30 05C38 05C20 05C69 05C40 PDFBibTeX XMLCite \textit{P.-L. Giscard} and \textit{P. Rochet}, Graphs Comb. 34, No. 6, 1197--1202 (2018; Zbl 1402.05104) Full Text: DOI arXiv
Williams, R. Ryan Faster all-pairs shortest paths via circuit complexity. (English) Zbl 1400.05075 SIAM J. Comput. 47, No. 5, 1965-1985 (2018). MSC: 05C12 05C38 05C20 05C76 05C85 68Q25 PDFBibTeX XMLCite \textit{R. R. Williams}, SIAM J. Comput. 47, No. 5, 1965--1985 (2018; Zbl 1400.05075) Full Text: DOI
Akbari, Saieed; Alizadeh, Hadi; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai Equimatchable claw-free graphs. (English) Zbl 1393.05203 Discrete Math. 341, No. 10, 2859-2871 (2018). MSC: 05C70 05C35 05C85 05C40 PDFBibTeX XMLCite \textit{S. Akbari} et al., Discrete Math. 341, No. 10, 2859--2871 (2018; Zbl 1393.05203) Full Text: DOI arXiv
Gao, Zuguang; Chen, Xudong; Başar, Tamer Stability structures of conjunctive Boolean networks. (English) Zbl 1387.93092 Automatica 89, 8-20 (2018). MSC: 93C30 93C55 94C10 94C15 37E15 PDFBibTeX XMLCite \textit{Z. Gao} et al., Automatica 89, 8--20 (2018; Zbl 1387.93092) Full Text: DOI arXiv
Aliakbarpour, Maryam; Biswas, Amartya Shankha; Gouleakis, Themis; Peebles, John; Rubinfeld, Ronitt; Yodpinyanee, Anak Sublinear-time algorithms for counting star subgraphs via edge sampling. (English) Zbl 1391.68120 Algorithmica 80, No. 2, 668-697 (2018). MSC: 68W20 05C30 05C85 68P15 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Aliakbarpour} et al., Algorithmica 80, No. 2, 668--697 (2018; Zbl 1391.68120) Full Text: DOI arXiv Link
Giscard, Pierre-Louis; Rochet, Paul; Wilson, Richard C. A Hopf algebra for counting cycles. (English) Zbl 1383.05173 Discrete Math. 341, No. 5, 1439-1448 (2018). MSC: 05C38 05C30 PDFBibTeX XMLCite \textit{P.-L. Giscard} et al., Discrete Math. 341, No. 5, 1439--1448 (2018; Zbl 1383.05173) Full Text: DOI arXiv
Kowaluk, Mirosław; Lingas, Andrzej Are unique subgraphs not easier to find? (English) Zbl 1476.68211 Inf. Process. Lett. 134, 57-61 (2018). MSC: 68R10 05C60 68Q25 PDFBibTeX XMLCite \textit{M. Kowaluk} and \textit{A. Lingas}, Inf. Process. Lett. 134, 57--61 (2018; Zbl 1476.68211) Full Text: DOI
Diamantini, M. Cristina; Trugenberger, Carlo A. Topological network entanglement as order parameter for the emergence of geometry. (English) Zbl 1516.83019 New J. Phys. 19, No. 10, Article ID 103024, 5 p. (2017). MSC: 83C45 81P40 81P17 PDFBibTeX XMLCite \textit{M. C. Diamantini} and \textit{C. A. Trugenberger}, New J. Phys. 19, No. 10, Article ID 103024, 5 p. (2017; Zbl 1516.83019) Full Text: DOI arXiv
Allen-Perkins, Alfonso; Pastor, Juan Manuel; Estrada, Ernesto Two-walks degree assortativity in graphs and networks. (English) Zbl 1426.05156 Appl. Math. Comput. 311, 262-271 (2017). MSC: 05C82 62H20 90B15 PDFBibTeX XMLCite \textit{A. Allen-Perkins} et al., Appl. Math. Comput. 311, 262--271 (2017; Zbl 1426.05156) Full Text: DOI arXiv
Malajovich, Beatriz; Abreu, Nair M. M.; Markenzon, Lilian On the characteristic polynomial of the power of a path. (English) Zbl 1397.05083 Proyecciones 36, No. 3, 529-543 (2017). MSC: 05C31 05C30 05C38 PDFBibTeX XMLCite \textit{B. Malajovich} et al., Proyecciones 36, No. 3, 529--543 (2017; Zbl 1397.05083) Full Text: DOI
Eden, Talya; Levi, Amit; Ron, Dana; Seshadhri, C. Approximately counting triangles in sublinear time. (English) Zbl 1380.68445 SIAM J. Comput. 46, No. 5, 1603-1646 (2017). MSC: 68W25 68Q25 68R10 68W20 PDFBibTeX XMLCite \textit{T. Eden} et al., SIAM J. Comput. 46, No. 5, 1603--1646 (2017; Zbl 1380.68445) Full Text: DOI arXiv
Le Gall, François; Nakajima, Shogo Quantum algorithm for triangle finding in sparse graphs. (English) Zbl 1380.68188 Algorithmica 79, No. 3, 941-959 (2017). MSC: 68Q12 PDFBibTeX XMLCite \textit{F. Le Gall} and \textit{S. Nakajima}, Algorithmica 79, No. 3, 941--959 (2017; Zbl 1380.68188) Full Text: DOI arXiv
Koutris, Paraschos; Milo, Tova; Roy, Sudeepa; Suciu, Dan Answering conjunctive queries with inequalities. (English) Zbl 1370.68070 Theory Comput. Syst. 61, No. 1, 2-30 (2017). MSC: 68P15 PDFBibTeX XMLCite \textit{P. Koutris} et al., Theory Comput. Syst. 61, No. 1, 2--30 (2017; Zbl 1370.68070) Full Text: DOI arXiv Link
Fürer, Martin On the combinatorial power of the Weisfeiler-Lehman algorithm. (English) Zbl 1489.05146 Fotakis, Dimitris (ed.) et al., Algorithms and complexity. 10th international conference, CIAC 2017, Athens, Greece, May 24–26, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10236, 260-271 (2017). MSC: 05C85 05C30 05C38 05C12 05C50 PDFBibTeX XMLCite \textit{M. Fürer}, Lect. Notes Comput. Sci. 10236, 260--271 (2017; Zbl 1489.05146) Full Text: DOI arXiv
Neethi, K. S.; Saxena, Sanjeev Maximum cardinality neighbourly sets in quadrilateral free graphs. (English) Zbl 1388.90117 J. Comb. Optim. 33, No. 2, 422-444 (2017). MSC: 90C35 PDFBibTeX XMLCite \textit{K. S. Neethi} and \textit{S. Saxena}, J. Comb. Optim. 33, No. 2, 422--444 (2017; Zbl 1388.90117) Full Text: DOI arXiv
Bulteau, Laurent; Froese, Vincent; Kutzkov, Konstantin; Pagh, Rasmus Triangle counting in dynamic graph streams. (English) Zbl 1348.68294 Algorithmica 76, No. 1, 259-278 (2016). MSC: 68W20 68W25 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Algorithmica 76, No. 1, 259--278 (2016; Zbl 1348.68294) Full Text: DOI arXiv
Chanchary, Farah; Maheshwari, Anil Counting subgraphs in relational event graphs. (English) Zbl 1475.68234 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 194-206 (2016). MSC: 68R10 05C30 05C82 68P05 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} and \textit{A. Maheshwari}, Lect. Notes Comput. Sci. 9627, 194--206 (2016; Zbl 1475.68234) Full Text: DOI
Jafargholi, Zahra; Viola, Emanuele 3SUM, 3XOR, triangles. (English) Zbl 1336.68132 Algorithmica 74, No. 1, 326-343 (2016). MSC: 68Q25 05C85 68W20 PDFBibTeX XMLCite \textit{Z. Jafargholi} and \textit{E. Viola}, Algorithmica 74, No. 1, 326--343 (2016; Zbl 1336.68132) Full Text: DOI arXiv
Meeks, Kitty The challenges of unbounded treewidth in parameterised subgraph counting problems. (English) Zbl 1327.05244 Discrete Appl. Math. 198, 170-194 (2016). MSC: 05C60 05C30 PDFBibTeX XMLCite \textit{K. Meeks}, Discrete Appl. Math. 198, 170--194 (2016; Zbl 1327.05244) Full Text: DOI arXiv
Berry, Jonathan W.; Fostvedt, Luke A.; Nordman, Daniel J.; Phillips, Cynthia A.; Seshadhri, C.; Wilson, Alyson G. Why do simple algorithms for triangle enumeration work in the real world? (English) Zbl 1461.68143 Internet Math. 11, No. 6, 555-571 (2015). MSC: 68R10 05C30 05C80 05C82 05C85 68W40 PDFBibTeX XMLCite \textit{J. W. Berry} et al., Internet Math. 11, No. 6, 555--571 (2015; Zbl 1461.68143) Full Text: DOI arXiv
Finocchi, Irene; Finocchi, Marco; Fusco, Emanuele G. Clique counting in MapReduce: algorithms and experiments. (English) Zbl 1347.68284 ACM J. Exp. Algorithm. 20, Article No. 1.7, 20 p. (2015). MSC: 68R10 05C30 05C69 05C82 05C85 68Q25 68W10 PDFBibTeX XMLCite \textit{I. Finocchi} et al., ACM J. Exp. Algorithm. 20, Article No. 1.7, 20 p. (2015; Zbl 1347.68284) Full Text: DOI arXiv
Mironowicz, P.; Dziekonski, A.; Mrozowski, M. A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU. (English) Zbl 1343.65046 SIAM J. Sci. Comput. 37, No. 6, C643-C666 (2015). MSC: 65F50 65Y05 65Y10 65Y20 PDFBibTeX XMLCite \textit{P. Mironowicz} et al., SIAM J. Sci. Comput. 37, No. 6, C643--C666 (2015; Zbl 1343.65046) Full Text: DOI
Jacob, Riko; Stöckel, Morten Fast output-sensitive matrix multiplication. (English) Zbl 1466.68082 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 766-778 (2015). MSC: 68W20 65F50 68W40 PDFBibTeX XMLCite \textit{R. Jacob} and \textit{M. Stöckel}, Lect. Notes Comput. Sci. 9294, 766--778 (2015; Zbl 1466.68082) Full Text: DOI
Williamson, Matthew; Subramani, K. On the negative cost girth problem in planar networks. (English) Zbl 1343.05144 J. Discrete Algorithms 35, 40-50 (2015); corrigendum ibid. 38-41, 52-53 (2016). MSC: 05C82 05C10 05C85 PDFBibTeX XMLCite \textit{M. Williamson} and \textit{K. Subramani}, J. Discrete Algorithms 35, 40--50 (2015; Zbl 1343.05144) Full Text: DOI
Jansson, Jesper; Lingas, Andrzej Computing the rooted triplet distance between galled trees by counting triangles. (English) Zbl 1284.05293 J. Discrete Algorithms 25, 66-78 (2014). MSC: 05C85 68R10 05C15 68P05 68M10 92D15 PDFBibTeX XMLCite \textit{J. Jansson} and \textit{A. Lingas}, J. Discrete Algorithms 25, 66--78 (2014; Zbl 1284.05293) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Unique subgraphs are not easier to find. (English) Zbl 1310.68113 Int. J. Comput. Math. 90, No. 6, 1247-1253 (2013). MSC: 68R10 68Q25 05C60 05C85 PDFBibTeX XMLCite \textit{M. Kowaluk} et al., Int. J. Comput. Math. 90, No. 6, 1247--1253 (2013; Zbl 1310.68113) Full Text: DOI
Roditty, Liam; Vassilevska Williams, Virginia Subquadratic time approximation algorithms for the girth. (English) Zbl 1423.05183 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 833-845 (2012). MSC: 05C85 05C38 68W25 68W40 PDFBibTeX XMLCite \textit{L. Roditty} and \textit{V. Vassilevska Williams}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 833--845 (2012; Zbl 1423.05183) Full Text: Link
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R. Finding a sun in building-free graphs. (English) Zbl 1256.05082 Graphs Comb. 28, No. 3, 347-364 (2012). MSC: 05C17 05C85 05C12 68Q17 68R10 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., Graphs Comb. 28, No. 3, 347--364 (2012; Zbl 1256.05082) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T.; Strash, Darren; Trott, Lowell Extended dynamic subgraph statistics using \(h\)-index parameterized data structures. (English) Zbl 1246.68170 Theor. Comput. Sci. 447, 44-52 (2012). MSC: 68R10 05C85 68P05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Theor. Comput. Sci. 447, 44--52 (2012; Zbl 1246.68170) Full Text: DOI arXiv
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Arboricity, \(h\)-index, and dynamic algorithms. (English) Zbl 1243.68228 Theor. Comput. Sci. 426-427, 75-90 (2012). MSC: 68R10 68P05 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Theor. Comput. Sci. 426--427, 75--90 (2012; Zbl 1243.68228) Full Text: DOI
Pagh, Rasmus; Tsourakakis, Charalampos E. Colorful triangle counting and a MapReduce implementation. (English) Zbl 1237.68245 Inf. Process. Lett. 112, No. 7, 277-281 (2012). MSC: 68W20 05C15 05C85 PDFBibTeX XMLCite \textit{R. Pagh} and \textit{C. E. Tsourakakis}, Inf. Process. Lett. 112, No. 7, 277--281 (2012; Zbl 1237.68245) Full Text: DOI
Voropaev, A. N. Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs. (Russian. English summary) Zbl 07310089 Prikl. Diskretn. Mat. 2011, No. 4(14), 42-55 (2011). MSC: 05-XX 68-XX PDFBibTeX XMLCite \textit{A. N. Voropaev}, Prikl. Diskretn. Mat. 2011, No. 4(14), 42--55 (2011; Zbl 07310089) Full Text: MNR
Durand, Arnaud; Habib, Michel Complexity issues for the sandwich homogeneous set problem. (English) Zbl 1213.05242 Discrete Appl. Math. 159, No. 7, 574-580 (2011). MSC: 05C85 PDFBibTeX XMLCite \textit{A. Durand} and \textit{M. Habib}, Discrete Appl. Math. 159, No. 7, 574--580 (2011; Zbl 1213.05242) Full Text: DOI
Yang, Bo; Chen, Xiaorong Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations. (English) Zbl 1300.93027 J. Syst. Sci. Complex. 22, No. 2, 252-259 (2009). MSC: 93A15 90B15 PDFBibTeX XMLCite \textit{B. Yang} and \textit{X. Chen}, J. Syst. Sci. Complex. 22, No. 2, 252--259 (2009; Zbl 1300.93027) Full Text: DOI
Brügmann, Daniel; Komusiewicz, Christian; Moser, Hannes On generating triangle-free graphs. (English) Zbl 1267.05246 Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 51-58 (2009). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{D. Brügmann} et al., Electron. Notes Discrete Math. 32, 51--58 (2009; Zbl 1267.05246) Full Text: DOI
Lingas, Andrzej; Lundell, Eva-Marta Efficient approximation algorithms for shortest cycles in undirected graphs. (English) Zbl 1214.68466 Inf. Process. Lett. 109, No. 10, 493-498 (2009). MSC: 68W25 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Lingas} and \textit{E.-M. Lundell}, Inf. Process. Lett. 109, No. 10, 493--498 (2009; Zbl 1214.68466) Full Text: DOI
Vassilevska, Virginia Efficient algorithms for clique problems. (English) Zbl 1191.68455 Inf. Process. Lett. 109, No. 4, 254-257 (2009). MSC: 68R05 68W05 68Q17 05C85 PDFBibTeX XMLCite \textit{V. Vassilevska}, Inf. Process. Lett. 109, No. 4, 254--257 (2009; Zbl 1191.68455) Full Text: DOI
Lévêque, Benjamin; Lin, David Y.; Maffray, Frédéric; Trotignon, Nicolas Detecting induced subgraphs. (English) Zbl 1227.05238 Discrete Appl. Math. 157, No. 17, 3540-3551 (2009). MSC: 05C85 05C60 05C83 PDFBibTeX XMLCite \textit{B. Lévêque} et al., Discrete Appl. Math. 157, No. 17, 3540--3551 (2009; Zbl 1227.05238) Full Text: DOI arXiv
Alon, Noga; Gutner, Shai Balanced hashing, color coding and approximate counting. (English) Zbl 1273.68270 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 1-16 (2009). MSC: 68R05 68Q25 68R10 92D10 PDFBibTeX XMLCite \textit{N. Alon} and \textit{S. Gutner}, Lect. Notes Comput. Sci. 5917, 1--16 (2009; Zbl 1273.68270) Full Text: DOI
Alon, Noga; Gutner, Shai Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. (English) Zbl 1192.68464 Algorithmica 54, No. 4, 544-556 (2009). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{N. Alon} and \textit{S. Gutner}, Algorithmica 54, No. 4, 544--556 (2009; Zbl 1192.68464) Full Text: DOI arXiv
Marx, Dániel A parameterized view on matroid optimization problems. (English) Zbl 1180.90275 Theor. Comput. Sci. 410, No. 44, 4471-4479 (2009). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{D. Marx}, Theor. Comput. Sci. 410, No. 44, 4471--4479 (2009; Zbl 1180.90275) Full Text: DOI
Eppstein, David; Spiro, Emma S. The \(h\)-index of a graph and its application to dynamic subgraph statistics. (English) Zbl 1253.68107 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 278-289 (2009). MSC: 68P05 68R10 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{E. S. Spiro}, Lect. Notes Comput. Sci. 5664, 278--289 (2009; Zbl 1253.68107) Full Text: DOI
Latapy, Matthieu Main-memory triangle computations for very large (sparse (power-law)) graphs. (English) Zbl 1152.68045 Theor. Comput. Sci. 407, No. 1-3, 458-473 (2008). MSC: 68R10 05C85 68W05 PDFBibTeX XMLCite \textit{M. Latapy}, Theor. Comput. Sci. 407, No. 1--3, 458--473 (2008; Zbl 1152.68045) Full Text: DOI
Naor, Assaf; Verstraëte, Jacques Parity check matrices and product representations of squares. (English) Zbl 1164.05005 Combinatorica 28, No. 2, 163-185 (2008). Reviewer: Ioan Tomescu (Bucharest) MSC: 05B20 94B65 05C35 PDFBibTeX XMLCite \textit{A. Naor} and \textit{J. Verstraëte}, Combinatorica 28, No. 2, 163--185 (2008; Zbl 1164.05005) Full Text: DOI
Lingas, Andrzej; Lundell, Eva-Marta Efficient approximation algorithms for shortest cycles in undirected graphs. (English) Zbl 1136.68466 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 736-746 (2008). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{A. Lingas} and \textit{E.-M. Lundell}, Lect. Notes Comput. Sci. 4957, 736--746 (2008; Zbl 1136.68466) Full Text: DOI
Lévêque, Benjamin; Lin, David Y.; Maffray, Frédéric; Trotignon, Nicolas Detecting induced subgraphs. (English) Zbl 1341.05169 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 207-211 (2007). MSC: 05C60 PDFBibTeX XMLCite \textit{B. Lévêque} et al., Electron. Notes Discrete Math. 29, 207--211 (2007; Zbl 1341.05169) Full Text: DOI arXiv
Brešar, Boštjan; Klavžar, Sandi; Škrekovski, Riste On cube-free median graphs. (English) Zbl 1115.05025 Discrete Math. 307, No. 3-5, 345-351 (2007). Reviewer: Frank Plastria (Brussels) MSC: 05C12 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Math. 307, No. 3--5, 345--351 (2007; Zbl 1115.05025) Full Text: DOI
Marx, Dániel Parameterized coloring problems on chordal graphs. (English) Zbl 1087.68072 Theor. Comput. Sci. 351, No. 3, 407-424 (2006). MSC: 68R10 05C15 PDFBibTeX XMLCite \textit{D. Marx}, Theor. Comput. Sci. 351, No. 3, 407--424 (2006; Zbl 1087.68072) Full Text: DOI
Marx, Dániel Parameterized graph separation problems. (English) Zbl 1086.68104 Theor. Comput. Sci. 351, No. 3, 394-406 (2006). MSC: 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{D. Marx}, Theor. Comput. Sci. 351, No. 3, 394--406 (2006; Zbl 1086.68104) Full Text: DOI
Köhler, Ekkehard Recognizing graphs without asteroidal triples. (English) Zbl 1118.05090 J. Discrete Algorithms 2, No. 4, 439-452 (2004). MSC: 05C85 05C75 68R10 PDFBibTeX XMLCite \textit{E. Köhler}, J. Discrete Algorithms 2, No. 4, 439--452 (2004; Zbl 1118.05090) Full Text: DOI
Eisenbrand, Friedrich; Grandoni, Fabrizio On the complexity of fixed parameter clique and dominating set. (English) Zbl 1071.68030 Theor. Comput. Sci. 326, No. 1-3, 57-67 (2004). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{F. Eisenbrand} and \textit{F. Grandoni}, Theor. Comput. Sci. 326, No. 1--3, 57--67 (2004; Zbl 1071.68030) Full Text: DOI
Eisenbrand, Friedrich; Grandoni, Fabrizio Detecting directed 4-cycles still faster. (English) Zbl 1175.68187 Inf. Process. Lett. 87, No. 1, 13-15 (2003). MSC: 68Q17 68W05 PDFBibTeX XMLCite \textit{F. Eisenbrand} and \textit{F. Grandoni}, Inf. Process. Lett. 87, No. 1, 13--15 (2003; Zbl 1175.68187) Full Text: DOI
Hempel, Harald; Kratsch, Dieter On claw-free asteroidal triple-free graphs. (English) Zbl 1002.68109 Discrete Appl. Math. 121, No. 1-3, 155-180 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Hempel} and \textit{D. Kratsch}, Discrete Appl. Math. 121, No. 1--3, 155--180 (2002; Zbl 1002.68109) Full Text: DOI
Bretto, A.; Cherifi, H.; Ubéda, S. An efficient algorithm for Helly property recognition in a linear hypergraph. (English) Zbl 1260.05157 Fourey, Sebastien (ed.) et al., IWCIA 2001. Proceedings of the 8th international workshop on combinatorial image analysis, Temple University, Philadelphia, PA, USA, August 23–24, 2001. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 46, 177-187 (2001). MSC: 05C85 05C65 68Q17 PDFBibTeX XMLCite \textit{A. Bretto} et al., Electron. Notes Theor. Comput. Sci. 46, 177--187 (2001; Zbl 1260.05157) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko Finding and counting small induced subgraphs efficiently. (English) Zbl 1339.05394 Inf. Process. Lett. 74, No. 3-4, 115-121 (2000). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Inf. Process. Lett. 74, No. 3--4, 115--121 (2000; Zbl 1339.05394) Full Text: DOI Link