Hevia Fajardo, Mario Alejandro; Sudholt, Dirk Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. (English) Zbl 07795034 Algorithmica 86, No. 2, 526-565 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. A. Hevia Fajardo} and \textit{D. Sudholt}, Algorithmica 86, No. 2, 526--565 (2024; Zbl 07795034) Full Text: DOI arXiv OA License
Antipov, Denis; Buzdalov, Maxim; Doerr, Benjamin Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. (English) Zbl 07795031 Algorithmica 86, No. 2, 442-484 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{D. Antipov} et al., Algorithmica 86, No. 2, 442--484 (2024; Zbl 07795031) Full Text: DOI arXiv OA License
Doerr, Benjamin; Kötzing, Timo Lower bounds from fitness levels made easy. (English) Zbl 07795029 Algorithmica 86, No. 2, 367-395 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Doerr} and \textit{T. Kötzing}, Algorithmica 86, No. 2, 367--395 (2024; Zbl 07795029) Full Text: DOI arXiv OA License
Doerr, Benjamin; Ghannane, Yassine; Ibn Brahim, Marouane Runtime analysis for permutation-based evolutionary algorithms. (English) Zbl 07785276 Algorithmica 86, No. 1, 90-129 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Doerr} et al., Algorithmica 86, No. 1, 90--129 (2024; Zbl 07785276) Full Text: DOI arXiv
Doerr, Benjamin; Rajabi, Amirhossein; Witt, Carsten Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. (English) Zbl 07785275 Algorithmica 86, No. 1, 64-89 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Doerr} et al., Algorithmica 86, No. 1, 64--89 (2024; Zbl 07785275) Full Text: DOI arXiv OA License
Bambury, Henry; Bultel, Antoine; Doerr, Benjamin An extended jump functions benchmark for the analysis of randomized search heuristics. (English) Zbl 07785273 Algorithmica 86, No. 1, 1-32 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{H. Bambury} et al., Algorithmica 86, No. 1, 1--32 (2024; Zbl 07785273) Full Text: DOI arXiv
Shimizu, Nobutaka; Shiraga, Takeharu Reversible random walks on dynamic graphs. (English) Zbl 1526.05129 Random Struct. Algorithms 63, No. 4, 1100-1136 (2023). MSC: 05C81 05C80 60J10 PDFBibTeX XMLCite \textit{N. Shimizu} and \textit{T. Shiraga}, Random Struct. Algorithms 63, No. 4, 1100--1136 (2023; Zbl 1526.05129) Full Text: DOI arXiv
Guterman, A. E.; Kreines, E. M.; Ostroukhova, N. V. Transformations of assembly number for 4-regular graphs. (English. Russian original) Zbl 1491.05118 J. Math. Sci., New York 262, No. 1, 11-26 (2022); translation from Zap. Nauchn. Semin. POMI 504, 21-46 (2021). MSC: 05C45 05C30 05C90 92D20 PDFBibTeX XMLCite \textit{A. E. Guterman} et al., J. Math. Sci., New York 262, No. 1, 11--26 (2022; Zbl 1491.05118); translation from Zap. Nauchn. Semin. POMI 504, 21--46 (2021) Full Text: DOI
Jin, Yu; Song, Bosheng; Li, Yanyan; Zhu, Ying Time-free solution to independent set problem using P systems with active membranes. (English) Zbl 1522.68213 Fundam. Inform. 182, No. 3, 243-255 (2021). MSC: 68Q07 05C69 PDFBibTeX XMLCite \textit{Y. Jin} et al., Fundam. Inform. 182, No. 3, 243--255 (2021; Zbl 1522.68213) Full Text: DOI arXiv
Bossek, Jakob; Neumann, Frank; Peng, Pan; Sudholt, Dirk Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem. (English) Zbl 1507.68348 Algorithmica 83, No. 10, 3148-3179 (2021). MSC: 68W40 05C15 68R10 68W20 68W50 PDFBibTeX XMLCite \textit{J. Bossek} et al., Algorithmica 83, No. 10, 3148--3179 (2021; Zbl 1507.68348) Full Text: DOI arXiv
Andreu-Guzmán, José Antonio; Valencia-Cabrera, Luis A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators. (English) Zbl 1469.68021 J. Membr. Comput. 2, No. 1, 1-13 (2020). MSC: 68Q07 05C15 68W50 PDFBibTeX XMLCite \textit{J. A. Andreu-Guzmán} and \textit{L. Valencia-Cabrera}, J. Membr. Comput. 2, No. 1, 1--13 (2020; Zbl 1469.68021) Full Text: DOI
Trejo-Sánchez, Joel Antonio; Fajardo-Delgado, Daniel; Gutierrez-Garcia, J. Octavio A genetic algorithm for the maximum 2-packing set problem. (English) Zbl 1464.05336 Int. J. Appl. Math. Comput. Sci. 30, No. 1, 173-184 (2020). MSC: 05C85 05C70 68W15 PDFBibTeX XMLCite \textit{J. A. Trejo-Sánchez} et al., Int. J. Appl. Math. Comput. Sci. 30, No. 1, 173--184 (2020; Zbl 1464.05336) Full Text: DOI
Mostafaie, Taha; Modarres Khiyabani, Farzin; Navimipour, Nima Jafari A systematic study on meta-heuristic approaches for solving the graph coloring problem. (English) Zbl 1458.90617 Comput. Oper. Res. 120, Article ID 104850, 29 p. (2020). MSC: 90C35 05C15 05C85 90C59 PDFBibTeX XMLCite \textit{T. Mostafaie} et al., Comput. Oper. Res. 120, Article ID 104850, 29 p. (2020; Zbl 1458.90617) Full Text: DOI
Baioletti, Marco; Milani, Alfredo; Santucci, Valentino Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs. (English) Zbl 1456.68234 Inf. Sci. 507, 37-52 (2020). MSC: 68W50 05A05 90C27 90C29 90C59 PDFBibTeX XMLCite \textit{M. Baioletti} et al., Inf. Sci. 507, 37--52 (2020; Zbl 1456.68234) Full Text: DOI
Shimizu, Nobutaka The average distance and the diameter of dense random regular graphs. (English) Zbl 1448.05182 Electron. J. Comb. 27, No. 3, Research Paper P3.62, 20 p. (2020). MSC: 05C80 05C12 PDFBibTeX XMLCite \textit{N. Shimizu}, Electron. J. Comb. 27, No. 3, Research Paper P3.62, 20 p. (2020; Zbl 1448.05182) Full Text: DOI
Gaetz, Marisa; Flanagan, Bethany; Scheepers, Marion; Shanks, Meghan Quantifying CDS sortability of permutations by strategic pile size. (English) Zbl 1433.05008 Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050014, 27 p. (2020). MSC: 05A05 05A17 68P10 68R05 PDFBibTeX XMLCite \textit{M. Gaetz} et al., Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050014, 27 p. (2020; Zbl 1433.05008) Full Text: DOI arXiv
Chalupa, David An order-based algorithm for minimum dominating set with application in graph mining. (English) Zbl 1436.68224 Inf. Sci. 426, 101-116 (2018). MSC: 68R10 05C69 05C82 05C85 68T20 68W20 PDFBibTeX XMLCite \textit{D. Chalupa}, Inf. Sci. 426, 101--116 (2018; Zbl 1436.68224) Full Text: DOI arXiv
Dediu, Adrian-Horia; Matos, Joana M.; Martín-Vide, Carlos Theory and practice of discrete interacting agents models. (English) Zbl 1396.68027 Adamatzky, Andrew (ed.), Emergent computation. A Festschrift for Selim G. Akl. Cham: Springer (ISBN 978-3-319-46375-9/hbk; 978-3-319-46376-6/ebook). Emergence, Complexity and Computation 24, 419-433 (2017). MSC: 68M14 05C81 PDFBibTeX XMLCite \textit{A.-H. Dediu} et al., Emerg. Complex. Comput. 24, 419--433 (2017; Zbl 1396.68027) Full Text: DOI
Marinakis, Yannis; Migdalas, Athanasios; Sifaleras, Angelo A hybrid particle swarm optimization – variable neighborhood search algorithm for constrained shortest path problems. (English) Zbl 1403.90642 Eur. J. Oper. Res. 261, No. 3, 819-834 (2017). MSC: 90C35 05C85 90C59 PDFBibTeX XMLCite \textit{Y. Marinakis} et al., Eur. J. Oper. Res. 261, No. 3, 819--834 (2017; Zbl 1403.90642) Full Text: DOI
Brijder, Robert Sorting by reversals and the theory of 4-regular graphs. (English) Zbl 1383.92049 Theor. Comput. Sci. 701, 40-53 (2017). MSC: 92D10 92D15 05C90 PDFBibTeX XMLCite \textit{R. Brijder}, Theor. Comput. Sci. 701, 40--53 (2017; Zbl 1383.92049) Full Text: DOI arXiv
Adamyk, K. L. M.; Holmes, E.; Mayfield, G. R.; Moritz, D. J.; Scheepers, M.; Tenner, B. E.; Wauck, H. C. Sorting permutations: games, genomes, and cycles. (English) Zbl 1386.05002 Discrete Math. Algorithms Appl. 9, No. 5, Article ID 1750063, 31 p. (2017). MSC: 05A05 68P10 91A46 05E15 92D15 PDFBibTeX XMLCite \textit{K. L. M. Adamyk} et al., Discrete Math. Algorithms Appl. 9, No. 5, Article ID 1750063, 31 p. (2017; Zbl 1386.05002) Full Text: DOI arXiv
Mahmood, Ali Abdulkareem; Maroosi, Ali; Muniyandi, Ravie Chandren Membrane computing to enhance time efficiency of minimum dominating set. (English) Zbl 1341.68050 Math. Comput. Sci. 10, No. 2, 249-261 (2016). MSC: 68Q05 05C69 68Q10 PDFBibTeX XMLCite \textit{A. A. Mahmood} et al., Math. Comput. Sci. 10, No. 2, 249--261 (2016; Zbl 1341.68050) Full Text: DOI
Fister, Iztok; Peterin, Iztok; Mernik, Marjan; Črepinšek, Matej Hybrid evolutionary algorithm for the b-chromatic number. (English) Zbl 1360.90302 J. Heuristics 21, No. 4, 501-521 (2015). MSC: 90C59 90C35 05C85 05C15 PDFBibTeX XMLCite \textit{I. Fister} et al., J. Heuristics 21, No. 4, 501--521 (2015; Zbl 1360.90302) Full Text: DOI
Brijder, Robert Recombination faults in gene assembly in ciliates modeled using multimatroids. (English) Zbl 1337.92139 Theor. Comput. Sci. 608, Part 1, 27-35 (2015). MSC: 92D10 05C90 05B35 PDFBibTeX XMLCite \textit{R. Brijder}, Theor. Comput. Sci. 608, Part 1, 27--35 (2015; Zbl 1337.92139) Full Text: DOI
Burns, Jonathan; Dolzhenko, Egor; Jonoska, Nataša; Muche, Tilahun; Saito, Masahico Four-regular graphs with rigid vertices associated to DNA recombination. (English) Zbl 1287.05063 Discrete Appl. Math. 161, No. 10-11, 1378-1394 (2013). MSC: 05C30 05C90 92D20 92D10 PDFBibTeX XMLCite \textit{J. Burns} et al., Discrete Appl. Math. 161, No. 10--11, 1378--1394 (2013; Zbl 1287.05063) Full Text: DOI
Farr, G. E. Transforms and minors for binary functions. (English) Zbl 1272.05195 Ann. Comb. 17, No. 3, 477-493 (2013). MSC: 05C85 05C83 05B35 82B20 94B99 PDFBibTeX XMLCite \textit{G. E. Farr}, Ann. Comb. 17, No. 3, 477--493 (2013; Zbl 1272.05195) Full Text: DOI
Fister, Iztok; Mernik, Marjan; Filipič, Bogdan Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm. (English) Zbl 1270.05039 Comput. Optim. Appl. 54, No. 3, 741-770 (2013). MSC: 05C15 05C85 90C59 PDFBibTeX XMLCite \textit{I. Fister} et al., Comput. Optim. Appl. 54, No. 3, 741--770 (2013; Zbl 1270.05039) Full Text: DOI arXiv
Tomassini, Marco; Daolio, Fabio A complex-networks view of hard combinatorial search spaces. (English) Zbl 1251.90341 Tantar, Emilia (ed.) et al., EVOLVE – a bridge between probability, set oriented numerics and evolutionary computation. Selected papers based on the presentations at the workshop 2011, Bourglinster Castle, Luxembourg, May 25–27, 2011. Berlin: Springer (ISBN 978-3-642-32725-4/hbk; 978-3-642-32726-1/ebook). Studies in Computational Intelligence 447, 223-245 (2013). MSC: 90C27 05C82 PDFBibTeX XMLCite \textit{M. Tomassini} and \textit{F. Daolio}, Stud. Comput. Intell. 447, 223--245 (2013; Zbl 1251.90341) Full Text: DOI
Brijder, Robert; Harju, Tero; Hoogeboom, Hendrik Jan Pivots, determinants, and perfect matchings of graphs. (English) Zbl 1251.05132 Theor. Comput. Sci. 454, 64-71 (2012). MSC: 05C70 05C90 92D10 PDFBibTeX XMLCite \textit{R. Brijder} et al., Theor. Comput. Sci. 454, 64--71 (2012; Zbl 1251.05132) Full Text: DOI arXiv
Azimi, Sepinoud; Harju, Tero; Langille, Miika; Petre, Ion Simple gene assembly as a rewriting of directed overlap-inclusion graphs. (English) Zbl 1402.92292 Theor. Comput. Sci. 454, 30-37 (2012). MSC: 92D10 05C90 68R10 PDFBibTeX XMLCite \textit{S. Azimi} et al., Theor. Comput. Sci. 454, 30--37 (2012; Zbl 1402.92292) Full Text: DOI
Manrique, Daniel; Rodríguez-Patón, Alfonso; Sosík, Petr On the scalability of biocomputing algorithms: the case of the maximum clique problem. (English) Zbl 1242.68292 Theor. Comput. Sci. 412, No. 51, 7075-7086 (2011). MSC: 68T20 05C69 68Q10 92C40 PDFBibTeX XMLCite \textit{D. Manrique} et al., Theor. Comput. Sci. 412, No. 51, 7075--7086 (2011; Zbl 1242.68292) Full Text: DOI
Pflueger, Nathan Graph reductions, binary rank, and pivots in gene assembly. (English) Zbl 1237.05181 Discrete Appl. Math. 159, No. 17, 2117-2134 (2011). MSC: 05C76 05C25 92D10 PDFBibTeX XMLCite \textit{N. Pflueger}, Discrete Appl. Math. 159, No. 17, 2117--2134 (2011; Zbl 1237.05181) Full Text: DOI arXiv
Brijder, Robert; Hoogeboom, Hendrik Jan The group structure of pivot and loop complementation on graphs and set systems. (English) Zbl 1230.05197 Eur. J. Comb. 32, No. 8, 1353-1367 (2011). MSC: 05C50 06A06 PDFBibTeX XMLCite \textit{R. Brijder} and \textit{H. J. Hoogeboom}, Eur. J. Comb. 32, No. 8, 1353--1367 (2011; Zbl 1230.05197) Full Text: DOI arXiv
Brijder, Robert; Hoogeboom, Hendrik Jan Nullity invariance for pivot and the interlace polynomial. (English) Zbl 1226.05152 Linear Algebra Appl. 435, No. 2, 277-288 (2011). MSC: 05C50 PDFBibTeX XMLCite \textit{R. Brijder} and \textit{H. J. Hoogeboom}, Linear Algebra Appl. 435, No. 2, 277--288 (2011; Zbl 1226.05152) Full Text: DOI arXiv
Brijder, Robert; Hoogeboom, Hendrik Jan Maximal pivots on graphs with an application to gene assembly. (English) Zbl 1215.05143 Discrete Appl. Math. 158, No. 18, 1977-1985 (2010). MSC: 05C76 05C90 PDFBibTeX XMLCite \textit{R. Brijder} and \textit{H. J. Hoogeboom}, Discrete Appl. Math. 158, No. 18, 1977--1985 (2010; Zbl 1215.05143) Full Text: DOI arXiv
Brijder, Robert; Langille, Miika; Petre, Ion Extended strings and graphs for simple gene assembly. (English) Zbl 1227.05008 Theor. Comput. Sci. 411, No. 4-5, 730-738 (2010). MSC: 05A05 68Q42 92D10 92E10 92C40 PDFBibTeX XMLCite \textit{R. Brijder} et al., Theor. Comput. Sci. 411, No. 4--5, 730--738 (2010; Zbl 1227.05008) Full Text: DOI
Angeleska, Angela; Jonoska, Nataša; Saito, Masahico DNA recombination through assembly graphs. (English) Zbl 1211.05171 Discrete Appl. Math. 157, No. 14, 3020-3037 (2009). MSC: 05C90 57M15 92D10 PDFBibTeX XMLCite \textit{A. Angeleska} et al., Discrete Appl. Math. 157, No. 14, 3020--3037 (2009; Zbl 1211.05171) Full Text: DOI
Alhazov, Artiom; Petre, Ion; Rogojin, Vladimir The parallel complexity of signed graphs: Decidability results and an improved algorithm. (English) Zbl 1167.68022 Theor. Comput. Sci. 410, No. 24-25, 2308-2315 (2009). MSC: 68Q25 05C22 05C85 68W10 92C37 92D10 PDFBibTeX XMLCite \textit{A. Alhazov} et al., Theor. Comput. Sci. 410, No. 24--25, 2308--2315 (2009; Zbl 1167.68022) Full Text: DOI
Carter, Nathan; Hadlock, Charles; Haughton, Dominique Generating random networks from a given distribution. (English) Zbl 1452.62039 Comput. Stat. Data Anal. 52, No. 8, 3928-3938 (2008). MSC: 62-08 05C80 91D30 PDFBibTeX XMLCite \textit{N. Carter} et al., Comput. Stat. Data Anal. 52, No. 8, 3928--3938 (2008; Zbl 1452.62039) Full Text: DOI
Harju, Tero; Li, Chang; Petre, Ion Graph theoretic approach to parallel gene assembly. (English) Zbl 1200.05238 Discrete Appl. Math. 156, No. 18, 3416-3429 (2008). MSC: 05C90 05C22 05C70 92D20 PDFBibTeX XMLCite \textit{T. Harju} et al., Discrete Appl. Math. 156, No. 18, 3416--3429 (2008; Zbl 1200.05238) Full Text: DOI
Díaz-Pernil, Daniel; Gutiérrez-Naranjo, Miguel A.; Pérez-Jiménez, Mario J.; Riscos-Núñez, Agustín A uniform family of tissue P systems with cell division solving 3-COL in a linear time. (English) Zbl 1151.68016 Theor. Comput. Sci. 404, No. 1-2, 76-87 (2008). MSC: 68Q10 68Q25 05C15 PDFBibTeX XMLCite \textit{D. Díaz-Pernil} et al., Theor. Comput. Sci. 404, No. 1--2, 76--87 (2008; Zbl 1151.68016) Full Text: DOI
Harju, Tero; Petre, Ion; Rogojin, Vladimir; Rozenberg, Grzegorz Patterns of simple gene assembly in ciliates. (English) Zbl 1146.92312 Discrete Appl. Math. 156, No. 14, 2581-2597 (2008). MSC: 92C40 92D10 68P10 05A05 PDFBibTeX XMLCite \textit{T. Harju} et al., Discrete Appl. Math. 156, No. 14, 2581--2597 (2008; Zbl 1146.92312) Full Text: DOI
Brijder, Robert; Hoogeboom, Hendrik Jan; Muskulus, Michael Strategies of loop recombination in ciliates. (English) Zbl 1144.92010 Discrete Appl. Math. 156, No. 10, 1736-1753 (2008). MSC: 92C37 92C40 05C90 05C05 PDFBibTeX XMLCite \textit{R. Brijder} et al., Discrete Appl. Math. 156, No. 10, 1736--1753 (2008; Zbl 1144.92010) Full Text: DOI arXiv
Harju, Tero; Li, Chang; Petre, Ion Parallel complexity of signed graphs for gene assembly in ciliates. (English) Zbl 1137.92305 Soft Comput. 12, No. 8, 731-737 (2008). MSC: 92C37 05C22 92D10 05C90 PDFBibTeX XMLCite \textit{T. Harju} et al., Soft Comput. 12, No. 8, 731--737 (2008; Zbl 1137.92305) Full Text: DOI