Jakob Bossek - RankMe

91 papers A* 1A 28B 2C 1Journal 39Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	MO-ELA: Rigorously Expanding Exploratory Landscape Features for Automated Algorithm Selection in Continuous Multi-Objective Optimisation. CoRR Oliver Ludger Preuß, Jeroen Rook, Jakob Bossek, Heike Trautmann
2025	A	`conf`	Automated Algorithm Configuration and Systematic Benchmarking for Heterogeneous MNK-Landscapes. GECCO Oliver Ludger Preuß, Carolin Mensendiek, Jeroen Rook, Jakob Bossek, Heike Trautmann
2025	A	`conf`	Cluster Prevention in Evolutionary Diversity Optimization for Parallel Machine Scheduling. GECCO Dominic Wittner, Jakob Bossek
2025	A*	`conf`	KernelMatmul: Scaling Gaussian Processes to Large Time Series. AAAI Tilman Hoffbauer, Holger H. Hoos, Jakob Bossek
2024	A	`conf`	Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem. GECCO Jakob Bossek, Christian Grimme
2024	A	`conf`	Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. GECCO Marcus Schmidbauer, Andre Opris, Jakob Bossek, Frank Neumann, Dirk Sudholt
2024	J	`jnl`	On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem. Evol. Comput. Jakob Bossek, Christian Grimme
2024	J	`jnl`	Runtime Analysis of Quality Diversity Algorithms. Algorithmica Jakob Bossek, Dirk Sudholt
2023	J	`jnl`	A study on the effects of normalized TSP features for automated algorithm selection. Theor. Comput. Sci. Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke
2023	J	`jnl`	Do additional target points speed up evolutionary algorithms? Theor. Comput. Sci. Jakob Bossek, Dirk Sudholt
2023	A	`conf`	Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space. GECCO Alejandro Marrero, Eduardo Segredo, Emma Hart, Jakob Bossek, Aneta Neumann
2023	J	`jnl`	On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem. CoRR Jakob Bossek, Christian Grimme
2023	A	`conf`	On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. GECCO Jakob Bossek, Aneta Neumann, Frank Neumann
2023	J	`jnl`	On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2023	A	`conf`	Runtime Analysis of Quality Diversity Algorithms. GECCO Jakob Bossek, Dirk Sudholt
2023	J	`jnl`	Runtime Analysis of Quality Diversity Algorithms. CoRR Jakob Bossek, Dirk Sudholt
2023	—	`conf`	Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP. SSCI Moritz Vinzent Seiler, Jeroen Rook, Jonathan Heins, Oliver Ludger Preuß, Jakob Bossek, Heike Trautmann
2022	—	`conf`	BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems. PPSN (1) Jonathan Heins, Jeroen Rook, Lennart Schäpermeier, Pascal Kerschke, Jakob Bossek, Heike Trautmann
2022	J	`jnl`	Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. CoRR Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
2022	—	`conf`	Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. PPSN (1) Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
2022	—	`conf`	Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. GECCO Companion Jakob Bossek, Aneta Neumann, Frank Neumann
2022	J	`jnl`	Exploring the Feature Space of TSP Instances Using Quality Diversity. CoRR Jakob Bossek, Frank Neumann
2022	A	`conf`	Exploring the feature space of TSP instances using quality diversity. GECCO Jakob Bossek, Frank Neumann
2022	—	`conf`	On the potential of automated algorithm configuration on multi-modal multi-objective optimization problems. GECCO Companion Jeroen Rook, Heike Trautmann, Jakob Bossek, Christian Grimme
2021	J	`jnl`	Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. GECCO Jakob Bossek, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation. CoRR Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. FOGA Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. GECCO Aneta Neumann, Jakob Bossek, Frank Neumann
2021	A	`conf`	Do additional optima speed up evolutionary algorithms? FOGA Jakob Bossek, Dirk Sudholt
2021	J	`jnl`	Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. CoRR Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. GECCO Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Evolutionary diversity optimization and the minimum spanning tree problem. GECCO Jakob Bossek, Frank Neumann
2021	—	`conf`	Exact Counting and Sampling of Optima for the Knapsack Problem. LION Jakob Bossek, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Exact Counting and Sampling of Optima for the Knapsack Problem. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Generating Instances with Performance Differences for More Than Just Two Algorithms. CoRR Jakob Bossek, Markus Wagner
2021	—	`conf`	Generating instances with performance differences for more than just two algorithms. GECCO Companion Jakob Bossek, Markus Wagner
2021	A	`conf`	On the potential of normalized TSP features for automated algorithm selection. FOGA Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	J	`jnl`	A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. Appl. Soft Comput. Jakob Bossek, Pascal Kerschke, Heike Trautmann
2020	B	`conf`	Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. CEC Jakob Bossek, Pascal Kerschke, Heike Trautmann
2020	J	`jnl`	Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. CoRR Jakob Bossek, Pascal Kerschke, Heike Trautmann
2020	J	`jnl`	Benchmarking in Optimization: Best Practice and Open Issues. CoRR Thomas Bartz-Beielstein, Carola Doerr, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, Pascal Kerschke, Manuel López-Ibáñez, Katherine M. Malan, Jason H. Moore, Boris Naujoks, Patryk Orzechowski, Vanessa Volz, Markus Wagner, Thomas Weise
2020	J	`jnl`	Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems. CoRR Aneta Neumann, Jakob Bossek, Frank Neumann
2020	—	`conf`	Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. PPSN (1) Moritz Seiler, Janina Pohl, Jakob Bossek, Pascal Kerschke, Heike Trautmann
2020	J	`jnl`	Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. CoRR Moritz Seiler, Janina Pohl, Jakob Bossek, Pascal Kerschke, Heike Trautmann
2020	J	`jnl`	Dynamic Bi-Objective Routing of Multiple Vehicles. CoRR Jakob Bossek, Christian Grimme, Heike Trautmann
2020	A	`conf`	Dynamic bi-objective routing of multiple vehicles. GECCO Jakob Bossek, Christian Grimme, Heike Trautmann
2020	J	`jnl`	Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. CoRR Jakob Bossek, Frank Neumann
2020	J	`jnl`	Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. CoRR Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann
2020	—	`conf`	Evolving Sampling Strategies for One-Shot Optimization Tasks. PPSN (1) Jakob Bossek, Carola Doerr, Pascal Kerschke, Aneta Neumann, Frank Neumann
2020	A	`conf`	Evolving diverse sets of tours for the travelling salesperson problem. GECCO Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Initial Design Strategies and their Effects on Sequential Model-Based Optimization. CoRR Jakob Bossek, Carola Doerr, Pascal Kerschke
2020	A	`conf`	Initial design strategies and their effects on sequential model-based optimization: an exploratory case study based on BBOB. GECCO Jakob Bossek, Carola Doerr, Pascal Kerschke
2020	J	`jnl`	More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	—	`conf`	Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. PPSN (1) Jakob Bossek, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. CoRR Vahid Roostapour, Jakob Bossek, Frank Neumann
2020	A	`conf`	Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. GECCO Vahid Roostapour, Jakob Bossek, Frank Neumann
2020	J	`jnl`	The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. CoRR Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
2020	A	`conf`	The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. GECCO Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
2020	B	`conf`	Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. CEC Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann
2020	J	`jnl`	Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. CoRR Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann
2019	C	`conf`	Bi-objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. EMO Jakob Bossek, Christian Grimme, Stephan Meisel, Günter Rudolph, Heike Trautmann
2019	A	`conf`	Evolving diverse TSP instances by means of novel and creative mutation operators. FOGA Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann
2019	A	`conf`	On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem. GECCO Jakob Bossek, Christian Grimme, Frank Neumann
2019	J	`jnl`	One-Shot Decision-Making with and without Surrogates. CoRR Jakob Bossek, Pascal Kerschke, Aneta Neumann, Frank Neumann, Carola Doerr
2019	J	`jnl`	OpenML: An R package to connect to the machine learning platform OpenML. Comput. Stat. Giuseppe Casalicchio, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, Bernd Bischl
2019	A	`conf`	Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2019	A	`conf`	Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. FOGA Jakob Bossek, Dirk Sudholt
2018	J	`jnl`	Leveraging TSP Solver Complementarity through Machine Learning. Evol. Comput. Pascal Kerschke, Lars Kotthoff, Jakob Bossek, Holger H. Hoos, Heike Trautmann
2018	A	`conf`	Local search effects in bi-objective orienteering. GECCO Jakob Bossek, Christian Grimme, Stephan Meisel, Günter Rudolph, Heike Trautmann
2018	—	`conf`	Multi-objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. LION Jakob Bossek, Heike Trautmann
2018	—	`conf`	Parameterization of state-of-the-art performance indicators: a robustness study based on inexact TSP solvers. GECCO (Companion) Pascal Kerschke, Jakob Bossek, Heike Trautmann
2018	—	`conf`	Performance assessment of multi-objective evolutionary algorithms with the R package ecr. GECCO (Companion) Jakob Bossek
2018	—	`conf`	Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. LION Jakob Bossek, Christian Grimme
2018	J	`jnl`	grapherator: A Modular Multi-Step Graph Generator. J. Open Source Softw. Jakob Bossek
2017	—	`conf`	A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem. SSCI Jakob Bossek, Christian Grimme
2017	—	`conf`	An extended mutation-based priority-rule integration concept for multi-objective machine scheduling. SSCI Jakob Bossek, Christian Grimme
2017	J	`jnl`	OpenML: An R Package to Connect to the Networked Machine Learning Platform OpenML. CoRR Giuseppe Casalicchio, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, Bernd Bischl
2017	—	`conf`	ecr 2.0: a modular framework for evolutionary computation in R. GECCO (Companion) Jakob Bossek
2017	J	`jnl`	mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem. J. Open Source Softw. Jakob Bossek
2017	J	`jnl`	smoof: Single- and Multi-Objective Optimization Test Functions. R J. Jakob Bossek
2016	—	`conf`	Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. LION Jakob Bossek, Heike Trautmann
2016	—	`conf`	Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. AI*IA Jakob Bossek, Heike Trautmann
2015	A	`conf`	Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle. GECCO Stephan Meisel, Christian Grimme, Jakob Bossek, Martin Wölck, Günter Rudolph, Heike Trautmann
2015	A	`conf`	Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement. GECCO Jakob Bossek, Bernd Bischl, Tobias Wagner, Günter Rudolph
2013	J	`jnl`	A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, Frank Neumann
2012	—	`conf`	Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. LION Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann