default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew M. Sutton
Person information
- affiliation: University of Minnesota Duluth, MN, USA
- affiliation (former): University of Potsdam, HPI, Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]Brahim Aboutaib
, Andrew M. Sutton:
The Influence of Noise on Multi-parent Crossover for an Island Model Genetic Algorithm. ACM Trans. Evol. Learn. Optim. 4(2): 11 (2024)- [c78]Brahim Aboutaib, Andrew M. Sutton:
Mixed Binomial Distributions for Binary Mutation Operators. GECCO 2024 - [c77]Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. PPSN (3) 2024: 19-35 - [c76]Jiwon Lee, Andrew M. Sutton:
Evolving Populations of Solved Subgraphs with Crossover and Constraint Repair. PPSN (3) 2024: 133-148 - [i12]Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR abs/2404.11496 (2024) - [i11]Jack Kearney, Frank Neumann, Andrew M. Sutton:
Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers. CoRR abs/2409.10144 (2024) - 2023
- [j22]Preethi Sankineni, Andrew M. Sutton:
Symmetry Breaking for Voting Mechanisms. Evol. Comput. 31(3): 309-335 (2023) - [j21]Luke Branson, Andrew M. Sutton:
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. Theor. Comput. Sci. 951: 113719 (2023) - [c75]Luke Branson, Andrew M. Sutton, Xiankun Yan:
Finding Antimagic Labelings of Trees by Evolutionary Search. FOGA 2023: 27-37 - [c74]Jack Kearney, Frank Neumann, Andrew M. Sutton:
Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. FOGA 2023: 96-104 - [c73]Per Kristian Lehre, Andrew M. Sutton:
Runtime Analysis with Variable Cost. GECCO 2023: 1611-1618 - [c72]Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. NeurIPS 2023 - [i10]Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. CoRR abs/2306.03409 (2023) - 2022
- [c71]Luke Branson, Andrew M. Sutton:
Evolving labelings of graceful graphs. GECCO 2022: 195-203 - [c70]Brahim Aboutaib, Andrew M. Sutton:
The influence of noise on multi-parent crossover for an island model GA. GECCO 2022: 666-674 - [c69]Brahim Aboutaib, Andrew M. Sutton:
Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms. PPSN (2) 2022: 555-568 - [i9]Luke Branson, Andrew M. Sutton:
Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems. CoRR abs/2203.13877 (2022) - 2021
- [j20]Andrew M. Sutton:
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem. Algorithmica 83(4): 1138-1163 (2021) - [j19]Andrew M. Sutton, Carsten Witt:
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica 83(10): 3180-3208 (2021) - [c68]Preethi Sankineni, Andrew M. Sutton:
Symmetry Breaking for Voting Mechanisms. EvoCOP 2021: 185-201 - [c67]Luke Branson, Andrew M. Sutton:
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. FOGA 2021: 3:1-3:10 - [c66]Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. GECCO 2021: 1187-1194 - [c65]Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton:
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT 2021: 188-206 - [i8]Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. CoRR abs/2102.05778 (2021) - 2020
- [j18]Pietro S. Oliveto, Andrew M. Sutton:
Theory of evolutionary computation - Special Issue Editorial. Theor. Comput. Sci. 832: 1-2 (2020) - [c64]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. AAAI 2020: 1460-1467 - [c63]L. Darrell Whitley, Hernán E. Aguirre, Andrew M. Sutton:
Understanding transforms of pseudo-boolean functions. GECCO 2020: 760-768 - [c62]Andrew M. Sutton, L. Darrell Whitley:
Approximation Speed-Up by Quadratization on LeadingOnes. PPSN (2) 2020: 686-698 - [p3]Frank Neumann, Andrew M. Sutton:
Parameterized Complexity Analysis of Randomized Search Heuristics. Theory of Evolutionary Computation 2020: 213-248 - [i7]Frank Neumann, Andrew M. Sutton:
Parameterized Complexity Analysis of Randomized Search Heuristics. CoRR abs/2001.05120 (2020)
2010 – 2019
- 2019
- [c61]Frank Neumann, Andrew M. Sutton:
Evolving Solutions to Community-Structured Satisfiability Formulas. AAAI 2019: 2346-2353 - [c60]Frank Neumann, Andrew M. Sutton:
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. FOGA 2019: 147-153 - [c59]Benjamin Doerr, Andrew M. Sutton:
When resampling to cope with noise, use median, not mean. GECCO 2019: 242-248 - [c58]L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós:
Next generation genetic algorithms. GECCO (Companion) 2019: 1113-1136 - [c57]Andrew M. Sutton, Carsten Witt:
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. GECCO 2019: 1515-1522 - [c56]Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton:
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) 2019: 117-134 - [i6]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. CoRR abs/1911.11451 (2019) - 2018
- [j17]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. 22(3): 484-497 (2018) - [c55]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO 2018: 301-308 - [c54]Václav Hasenöhrl, Andrew M. Sutton:
On the runtime dynamics of the compact genetic algorithm on jump functions. GECCO 2018: 967-974 - [c53]L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós:
Next generation genetic algorithms. GECCO (Companion) 2018: 1039-1059 - [c52]Andrew M. Sutton:
Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. GECCO 2018: 1531-1538 - [c51]Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. PPSN (2) 2018: 141-152 - 2017
- [j16]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 78(2): 561-586 (2017) - [j15]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. 21(3): 477-490 (2017) - [c50]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c49]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - [c48]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - [i5]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - 2016
- [j14]Andrew M. Sutton:
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 75(3): 507-528 (2016) - [j13]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. Evol. Comput. 24(2): 237-254 (2016) - [j12]Mohsen Amini Salehi, Jay Smith, Anthony A. Maciejewski, Howard Jay Siegel, Edwin K. P. Chong, Jonathan Apodaca, Luis Diego Briceno, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash:
Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system. J. Parallel Distributed Comput. 97: 96-111 (2016) - [c47]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) 2016: 3-4 - [c46]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) 2016: 161-162 - [c45]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO 2016: 645-652 - [c44]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN 2016: 761-770 - [c43]Tobias Friedrich, Timo Kötzing, Andrew M. Sutton:
On the Robustness of Evolving Populations. PPSN 2016: 771-781 - [c42]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN 2016: 890-900 - [e2]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016. ACM 2016, ISBN 978-1-4503-4206-3 [contents] - [e1]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings. ACM 2016, ISBN 978-1-4503-4323-7 [contents] - [i4]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR abs/1608.03123 (2016) - 2015
- [j11]Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba:
Fitness Probability Distribution of Bit-Flip Mutation. Evol. Comput. 23(2): 217-248 (2015) - [j10]Pietro S. Oliveto, Andrew M. Sutton:
Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014. Evol. Comput. 23(4): 509-511 (2015) - [j9]Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann:
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theor. Comput. Sci. 561: 24-36 (2015) - [c41]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. GECCO 2015: 17-24 - [c40]Frank Neumann, Andrew M. Sutton:
Parameterized Complexity Analysis of Evolutionary Algorithms. GECCO (Companion) 2015: 435-450 - [c39]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO 2015: 1415-1422 - [c38]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. ISAAC 2015: 140-150 - [i3]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Sex in Noisy Evolutionary Search. CoRR abs/1502.02793 (2015) - 2014
- [j8]Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma:
Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evol. Comput. 22(4): 595-628 (2014) - [j7]L. Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano:
The component model for elementary landscapes and partial neighborhoods. Theor. Comput. Sci. 545: 59-75 (2014) - [j6]Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly:
The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. 545: 94-107 (2014) - [c37]Francisco Chicano, L. Darrell Whitley, Andrew M. Sutton:
Efficient identification of improving moves in a ball for pseudo-boolean problems. GECCO 2014: 437-444 - [c36]Frank Neumann, Andrew M. Sutton:
Parameterized complexity analysis of evolutionary algorithms. GECCO (Companion) 2014: 607-622 - [c35]Andrew M. Sutton:
Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. GECCO 2014: 1431-1438 - [c34]Andrew M. Sutton, Frank Neumann:
Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. PPSN 2014: 942-951 - 2013
- [j5]Andrew M. Sutton, Francisco Chicano, L. Darrell Whitley:
Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube. Evol. Comput. 21(4): 561-590 (2013) - [j4]Andrew M. Sutton:
Thomas Jansen: Analyzing Evolutionary Algorithms: The Computer Science Perspective - Springer, 2013, 255 pp, ISBN: 978-3-642-17338-7. Genet. Program. Evolvable Mach. 14(4): 473-475 (2013) - [j3]Andrew M. Sutton, Jonathan I. Maletic:
Emulating C++0x concepts. Sci. Comput. Program. 78(9): 1449-1469 (2013) - [c33]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2037-2044 - [c32]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2045-2052 - [c31]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscapes: theory and applications. GECCO (Companion) 2013: 545-566 - [c30]Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann:
Population size matters: rigorous runtime results for maximizing the hypervolume indicator. GECCO 2013: 1613-1620 - [i2]Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba:
Fitness Probability Distribution of Bit-Flip Mutation. CoRR abs/1309.2979 (2013) - 2012
- [j2]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theor. Comput. Sci. 425: 58-74 (2012) - [c29]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI 2012: 1105-1111 - [c28]Andrew M. Sutton, Jareth Day, Frank Neumann:
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO 2012: 433-440 - [c27]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscapes: theory and applications. GECCO (Companion) 2012: 941-960 - [c26]Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly:
The max problem revisited: the importance of mutation in genetic programming. GECCO 2012: 1333-1340 - [c25]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) 2012: 52-61 - [p2]L. Darrell Whitley, Andrew M. Sutton:
Genetic Algorithms - A Survey of Models and Methods. Handbook of Natural Computing 2012: 637-671 - [i1]Andrew M. Sutton, Frank Neumann:
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. CoRR abs/1207.0578 (2012) - 2011
- [c24]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Approximating the distribution of fitness over hamming regions. FOGA 2011: 93-104 - [c23]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. GECCO 2011: 973-980 - [c22]Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson:
MosaiCode: Visualizing large scale software: A tool demonstration. VISSOFT 2011: 1-4 - 2010
- [c21]Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic:
Identification of Idiom Usage in C++ Generic Libraries. ICPC 2010: 160-169 - [c20]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Directed Plateau Search for MAX-k-SAT. SOCS 2010: 90-97
2000 – 2009
- 2009
- [c19]Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. GECCO 2009: 365-372 - [c18]L. Darrell Whitley, Andrew M. Sutton:
Partial neighborhoods of elementary landscapes. GECCO 2009: 381-388 - [c17]L. Darrell Whitley, Andrew M. Sutton:
Elementary landscape analysis. GECCO (Companion) 2009: 3227-3236 - [c16]Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic:
Abstracting the template instantiation relation in C++. ICSM 2009: 559-562 - [c15]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Estimating Bounds on Expected Plateau Size in MAXSAT Problems. SLS 2009: 31-45 - [c14]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
A Theoretical Analysis of the k-Satisfiability Search Space. SLS 2009: 46-60 - [c13]David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley:
Improved Robustness through Population Variance in Ant Colony Optimization. SLS 2009: 145-149 - 2008
- [c12]L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe:
Understanding elementary landscapes. GECCO 2008: 585-592 - [c11]Andrew M. Sutton, Jonathan I. Maletic:
Automatically identifying C++0x concepts in function templates. ICSM 2008: 57-66 - [c10]Monte Lunacek, L. Darrell Whitley, Andrew M. Sutton:
The Impact of Global Structure on Search. PPSN 2008: 498-507 - [p1]L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe, Laura Barbulescu:
Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice 2008: 219-243 - 2007
- [j1]Andrew M. Sutton, Jonathan I. Maletic:
Recovering UML class models from C++: A detailed explanation. Inf. Softw. Technol. 49(3): 212-229 (2007) - [c9]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling. ICAPS 2007: 320-327 - [c8]Andrew M. Sutton, Monte Lunacek, L. Darrell Whitley:
Differential evolution and non-separability: using selective pressure to focus search. GECCO 2007: 1428-1435 - [c7]Andrew M. Sutton, Jonathan I. Maletic:
How We Manage Portability and Configuration with the C Preprocessor. ICSM 2007: 275-284 - [c6]Jay Smith, Luis Diego Briceno, Anthony A. Maciejewski, Howard Jay Siegel, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash:
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment. IPDPS 2007: 1-10 - 2006
- [c5]Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules. ICAPS 2006: 430-433 - [c4]Andrew M. Sutton, L. Darrell Whitley, Monte Lunacek, Adele E. Howe:
PSO and multi-funnel landscapes: how cooperation might limit exploration. GECCO 2006: 75-82 - 2005
- [c3]Andrew M. Sutton, Huzefa H. Kagdi, Jonathan I. Maletic, L. Gwenn Volkert:
Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones. GECCO 2005: 1079-1080 - [c2]Huzefa H. Kagdi, Jonathan I. Maletic, Andrew M. Sutton:
Context-Free Slicing of UML Class Models. ICSM 2005: 635-638 - [c1]Andrew M. Sutton, Jonathan I. Maletic:
Mappings for Accurately Reverse Engineering UML Class Models from C++. WCRE 2005: 175-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
