Pelofske, Elijah; Hahn, Georg; Djidjev, Hristo N. Solving larger maximum clique problems using parallel quantum annealing. (English) Zbl 07695202 Quantum Inf. Process. 22, No. 5, Paper No. 219, 22 p. (2023). MSC: 81P68 PDFBibTeX XMLCite \textit{E. Pelofske} et al., Quantum Inf. Process. 22, No. 5, Paper No. 219, 22 p. (2023; Zbl 07695202) Full Text: DOI arXiv
Mutzel, Petra Algorithmic data science (Invited Talk). (English) Zbl 07559112 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 3, 15 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Mutzel}, LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 3, 15 p. (2019; Zbl 07559112) Full Text: DOI
Züge, Alexandre Prusch; Carmo, Renato On comparing algorithms for the maximum clique problem. (English) Zbl 1394.05127 Discrete Appl. Math. 247, 1-13 (2018). MSC: 05C85 05C69 05C35 05C80 PDFBibTeX XMLCite \textit{A. P. Züge} and \textit{R. Carmo}, Discrete Appl. Math. 247, 1--13 (2018; Zbl 1394.05127) Full Text: DOI
Dainyak, Aleksandr B.; Sapozhenko, Aleksandr A. Independent sets in graphs. (English. Russian original) Zbl 1352.05144 Discrete Math. Appl. 26, No. 6, 323-346 (2016); translation from Diskretn. Mat. 28, No. 1, 44-77 (2016). MSC: 05C69 05C30 05C35 PDFBibTeX XMLCite \textit{A. B. Dainyak} and \textit{A. A. Sapozhenko}, Discrete Math. Appl. 26, No. 6, 323--346 (2016; Zbl 1352.05144); translation from Diskretn. Mat. 28, No. 1, 44--77 (2016) Full Text: DOI
Song, Yinglei On the independent set problem in random graphs. (English) Zbl 1334.05108 Int. J. Comput. Math. 92, No. 11, 2233-2242 (2015). MSC: 05C69 05C80 05C85 PDFBibTeX XMLCite \textit{Y. Song}, Int. J. Comput. Math. 92, No. 11, 2233--2242 (2015; Zbl 1334.05108) Full Text: DOI arXiv Link
Borowiecki, Piotr; Rautenbach, Dieter New potential functions for greedy independence and coloring. (English) Zbl 1306.05175 Discrete Appl. Math. 182, 61-72 (2015). MSC: 05C69 05C15 05C07 05C85 PDFBibTeX XMLCite \textit{P. Borowiecki} and \textit{D. Rautenbach}, Discrete Appl. Math. 182, 61--72 (2015; Zbl 1306.05175) Full Text: DOI
Prot, D.; Rapine, C.; Constans, S.; Fondacci, R. A 4D-sequencing approach for air traffic management. (English) Zbl 1304.90134 Eur. J. Oper. Res. 237, No. 2, 411-425 (2014). MSC: 90B90 90B06 90B20 05C85 90C35 PDFBibTeX XMLCite \textit{D. Prot} et al., Eur. J. Oper. Res. 237, No. 2, 411--425 (2014; Zbl 1304.90134) Full Text: DOI
Bermudo, S.; Fernau, H. Computing the differential of a graph: hardness, approximability and exact algorithms. (English) Zbl 1288.05262 Discrete Appl. Math. 165, 69-82 (2014). MSC: 05C85 68Q17 68R10 68M10 68W40 PDFBibTeX XMLCite \textit{S. Bermudo} and \textit{H. Fernau}, Discrete Appl. Math. 165, 69--82 (2014; Zbl 1288.05262) Full Text: DOI
Brankovic, Ljiljana; Fernau, Henning A novel parameterised approximation algorithm for minimum vertex cover. (English) Zbl 1407.68542 Theor. Comput. Sci. 511, 85-108 (2013). MSC: 68W25 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{L. Brankovic} and \textit{H. Fernau}, Theor. Comput. Sci. 511, 85--108 (2013; Zbl 1407.68542) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049 Algorithmica 65, No. 3, 584-604 (2013). MSC: 05C22 05C35 05C05 05C85 90C39 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 65, No. 3, 584--604 (2013; Zbl 1269.05049) Full Text: DOI
Downey, Rodney G.; Thilikos, Dimitrios M. Confronting intractability via parameters. (English) Zbl 1298.68094 Comput. Sci. Rev. 5, No. 4, 279-317 (2011). MSC: 68Q15 68Q25 68Q17 68W40 68-02 PDFBibTeX XMLCite \textit{R. G. Downey} and \textit{D. M. Thilikos}, Comput. Sci. Rev. 5, No. 4, 279--317 (2011; Zbl 1298.68094) Full Text: DOI arXiv
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R. The complexity of König subgraph problems and above-guarantee vertex cover. (English) Zbl 1243.05203 Algorithmica 61, No. 4, 857-881 (2011). Reviewer: Arnfried Kemnitz (Braunschweig) MSC: 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Mishra} et al., Algorithmica 61, No. 4, 857--881 (2011; Zbl 1243.05203) Full Text: DOI Link
Lozin, Vadim V. Stability preserving transformations of graphs. (English) Zbl 1250.05083 Ann. Oper. Res. 188, 331-341 (2011). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{V. V. Lozin}, Ann. Oper. Res. 188, 331--341 (2011; Zbl 1250.05083) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Branch and recharge: exact algorithms for generalized domination. (English) Zbl 1244.68082 Algorithmica 61, No. 2, 252-273 (2011). Reviewer: Ludovit Niepel (Safat) MSC: 68W05 05C85 05C69 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 61, No. 2, 252--273 (2011; Zbl 1244.68082) Full Text: DOI
Borowiecki, Piotr; Göring, Frank GreedyMAX-type algorithms for the maximum independent set problem. (English) Zbl 1298.05298 Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 146-156 (2011). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{P. Borowiecki} and \textit{F. Göring}, Lect. Notes Comput. Sci. 6543, 146--156 (2011; Zbl 1298.05298) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo On maximum independent sets in \(P_{5}\)-free graphs. (English) Zbl 1210.05164 Discrete Appl. Math. 158, No. 9, 1041-1044 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Discrete Appl. Math. 158, No. 9, 1041--1044 (2010; Zbl 1210.05164) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket Iterative compression and exact algorithms. (English) Zbl 1186.68187 Theor. Comput. Sci. 411, No. 7-9, 1045-1053 (2010). MSC: 68P30 68Q17 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 411, No. 7--9, 1045--1053 (2010; Zbl 1186.68187) Full Text: DOI
Cygan, Marek; Kowalik, Łukasz; Wykurz, Mateusz Exponential-time approximation of weighted set cover. (English) Zbl 1202.68482 Inf. Process. Lett. 109, No. 16, 957-961 (2009). MSC: 68W25 PDFBibTeX XMLCite \textit{M. Cygan} et al., Inf. Process. Lett. 109, No. 16, 957--961 (2009; Zbl 1202.68482) Full Text: DOI
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th. Approximation of min coloring by moderately exponential algorithms. (English) Zbl 1197.05141 Inf. Process. Lett. 109, No. 16, 950-954 (2009). MSC: 05C85 05C15 68R10 68W25 PDFBibTeX XMLCite \textit{N. Bourgeois} et al., Inf. Process. Lett. 109, No. 16, 950--954 (2009; Zbl 1197.05141) Full Text: DOI Link
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
Fomin, Fedor V.; Mazoit, Frédéric; Todinca, Ioan Computing branchwidth via efficient triangulations and blocks. (English) Zbl 1211.05163 Discrete Appl. Math. 157, No. 12, 2726-2736 (2009). MSC: 05C85 05C12 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 157, No. 12, 2726--2736 (2009; Zbl 1211.05163) Full Text: DOI HAL
Chen, Jianer; Liu, Yang An improved SAT algorithm in terms of formula length. (English) Zbl 1253.68166 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, 144-155 (2009). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{J. Chen} and \textit{Y. Liu}, Lect. Notes Comput. Sci. 5664, 144--155 (2009; Zbl 1253.68166) Full Text: DOI
Kowalik, Łukasz Improved edge-coloring with three colors. (English) Zbl 1171.68031 Theor. Comput. Sci. 410, No. 38-40, 3733-3742 (2009). MSC: 68R10 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{Ł. Kowalik}, Theor. Comput. Sci. 410, No. 38--40, 3733--3742 (2009; Zbl 1171.68031) Full Text: DOI
Komusiewicz, Christian; Hüffner, Falk; Moser, Hannes; Niedermeier, Rolf Isolation concepts for efficiently enumerating dense subgraphs. (English) Zbl 1171.68030 Theor. Comput. Sci. 410, No. 38-40, 3640-3654 (2009). MSC: 68R10 05C30 05C69 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., Theor. Comput. Sci. 410, No. 38--40, 3640--3654 (2009; Zbl 1171.68030) Full Text: DOI
Kanj, Iyad A.; Kratsch, Dieter Convex recoloring revisited: complexity and exact algorithms. (English) Zbl 1248.05201 Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 388-397 (2009). MSC: 05C85 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{I. A. Kanj} and \textit{D. Kratsch}, Lect. Notes Comput. Sci. 5609, 388--397 (2009; Zbl 1248.05201) Full Text: DOI
Della Croce, Federico; Grosso, Andrea; Locatelli, Marco A heuristic approach for the max-min diversity problem based on max-clique. (English) Zbl 1179.90331 Comput. Oper. Res. 36, No. 8, 2429-2433 (2009). MSC: 90C59 PDFBibTeX XMLCite \textit{F. Della Croce} et al., Comput. Oper. Res. 36, No. 8, 2429--2433 (2009; Zbl 1179.90331) Full Text: DOI
Liedloff, Mathieu Finding a dominating set on bipartite graphs. (English) Zbl 1185.05111 Inf. Process. Lett. 107, No. 5, 154-157 (2008). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Liedloff}, Inf. Process. Lett. 107, No. 5, 154--157 (2008; Zbl 1185.05111) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket Iterative compression and exact algorithms. (English) Zbl 1173.68537 Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 335-346 (2008). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 5162, 335--346 (2008; Zbl 1173.68537) Full Text: DOI
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu On independent sets and bicliques in graphs. (English) Zbl 1202.05096 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 171-182 (2008). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Gaspers} et al., Lect. Notes Comput. Sci. 5344, 171--182 (2008; Zbl 1202.05096) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor On the minimum feedback vertex set problem: Exact and enumeration algorithms. (English) Zbl 1170.68029 Algorithmica 52, No. 2, 293-307 (2008). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 52, No. 2, 293--307 (2008; Zbl 1170.68029) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter Solving connected dominating set faster than \(2^n\). (English) Zbl 1170.68030 Algorithmica 52, No. 2, 153-166 (2008). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 52, No. 2, 153--166 (2008; Zbl 1170.68030) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429 Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 430-441 (2008). MSC: 68R10 68Q25 90C35 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 5193, 430--441 (2008; Zbl 1158.68429) Full Text: DOI
Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A. A moderately exponential time algorithm for full degree spanning tree. (English) Zbl 1139.68391 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 479-489 (2008). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Gaspers} et al., Lect. Notes Comput. Sci. 4978, 479--489 (2008; Zbl 1139.68391) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. (English) Zbl 1183.05084 Inf. Process. Lett. 104, No. 2, 65-72 (2007). MSC: 05C85 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Inf. Process. Lett. 104, No. 2, 65--72 (2007; Zbl 1183.05084) Full Text: DOI