Visualization of Parallel Execution Graphs. - Björn Steckelbach; Till Bubeck; Ulrich Fößmeier; Michael Kaufmann 001; Marcus Ritt; Wolfgang Rosenstiel (GD, 1998)

Object-Oriented Message-Passing with TPO++ (Research Note). - Tobias Grundmann; Marcus Ritt; Wolfgang Rosenstiel (Euro-Par, 2000)

TPO++: An Object-Oriented Message-Passing Library in C++. - Tobias Grundmann; Marcus Ritt; Wolfgang Rosenstiel (ICPP, 2000)

Eine objektorientierte Kommunikationsbibliothek zur parallelen Programmierung - TPO++. - Marcus Ritt (2003)

Improving Monte Carlo Localization in sparse environments using structural environment information. - Edson Prestes e Silva Jr.; Marcus Ritt; Gustavo Führ (IROS, 2008)

Object-Oriented Message-Passing in Heterogeneous Environments. - Patrick Heckeler; Marcus Ritt; Jörg Behrend; Wolfgang Rosenstiel (PVM/MPI, 2008)

An integer linear programming approach for approximate string comparison. - Marcus Ritt; Alysson M. Costa; Sérgio L. S. Mergen; Viviane Moreira Orengo (Eur. J. Oper. Res., 2009)

An improved particle filter for sparse environments. - Edson Prestes e Silva Jr.; Marcus Ritt; Gustavo Führ (J. Braz. Comput. Soc., 2009)

A Cost-Effective Technique for Mapping BLUTs to QLUTs in FPGAs. - Marcus Ritt; Carlos Arthur Lang Lisbôa; Luigi Carro; Cristiano Lazzari (FPL, 2010)

Motion planning with pull moves - Marcus Ritt (CoRR, 2010)

A biased random-key genetic algorithm for road congestion minimization. - Luciana S. Buriol; Michael J. Hirsch; Panos M. Pardalos; Tania Querido; Mauricio G. C. Resende; Marcus Ritt (Optim. Lett., 2010)

On the Smoothed Price of Anarchy of the Traffic Assignment Problem. - Luciana S. Buriol; Marcus Ritt; Félix Carvalho Rodrigues; Guido Schäfer (ATMOS, 2011)

Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents. - Ana L. C. Bazzan; Maicon de Brito do Amarante; Guilherme G. Azzi; Alexander J. Benavides; Luciana S. Buriol; Leonardo F. S. Moura; Marcus Ritt; Tiago Sommer (ECMS, 2011)

A comparison of formulations for the simple assembly line balancing problem - Marcus Ritt; Alysson M. Costa (CoRR, 2011)

A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. - Roger Reis; Marcus Ritt; Luciana S. Buriol; Mauricio G. C. Resende (Int. Trans. Oper. Res., 2011)

A real-valued genetic algorithm for gemstone cutting. - Victor Billy da Silva; Marcus Ritt; Joao Batista da Paz Carvalho; Marcos Jose Brusso; Juliano Tonezer da Silva; Alexandre Lazaretti Zanatta (CLEI, 2012)

Simple heuristics for the assembly line worker assignment and balancing problem. - Mayron César O. Moreira; Marcus Ritt; Alysson M. Costa; Antonio Augusto Chaves (J. Heuristics, 2012)

A New Memory Banking System for Energy-Efficient Wireless Sensor Networks. - Leonardo Steinfeld; Fernando Silveira; Marcus Ritt; Luigi Carro (DCOSS, 2013)

Low-Power Processors Require Effective Memory Partitioning. - Leonardo Steinfeld; Marcus Ritt; Fernando Silveira; Luigi Carro (IESS, 2013)

Timing error handling on CGRAs. - Thomas Schweizer; Wolfgang Rosenstiel; Luigi Vaz Ferreira; Marcus Ritt (ReConFig, 2013)

Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases. - André Grahl Pereira; Marcus Ritt; Luciana Salete Buriol (SOCS, 2013)

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks. - Alexander J. Benavides; Marcus Ritt; Luciana S. Buriol; Paulo Morelato França (Comput. Oper. Res., 2013)

Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem. - Leonardo Borba; Marcus Ritt (CoRR, 2013)

Deriving Reduced Transistor Count Circuits from AIGs. - Jody Maick Matos; Marcus Ritt; Renato P. Ribas; André Inácio Reis (SBCCI, 2014)

A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem. - Leonardo Borba; Marcus Ritt (Comput. Oper. Res., 2014)

Flow shop scheduling with heterogeneous workers. - Alexander J. Benavides; Marcus Ritt; Cristóbal Miralles (Eur. J. Oper. Res., 2014)

Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops. - Alexander Javier Benavides; Marcus Ritt (ICAPS, 2015)

Solving Sokoban Optimally with Domain-Dependent Move Pruning. - Renato R. Leme; André Grahl Pereira; Marcus Ritt; Luciana S. Buriol (BRACIS, 2015)

Including workers with disabilities in flow shop scheduling. - Germano C. Carniel; Alexander J. Benavides; Marcus Ritt; Cristóbal Miralles (CASE, 2015)

Optimal Sokoban solving using pattern databases with specific domain knowledge. - André Grahl Pereira; Marcus Ritt; Luciana S. Buriol (Artif. Intell., 2015)

Optimum design of a banked memory with power management for wireless sensor networks. - Leonardo Steinfeld; Marcus Ritt; Fernando Silveira; Luigi Carro (Wirel. Networks, 2015)

Improved Airport Ground Traffic Control with Domain-Dependent Heuristics. - Augusto B. Corrêa; André Grahl Pereira; Marcus Ritt (BRACIS, 2016)

Solving Atomix with Pattern Databases. - Alex Gliesch; Marcus Ritt (BRACIS, 2016)

A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem. - Marcus Ritt (CASE, 2016)

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban. - André Grahl Pereira; Robert Holte; Jonathan Schaeffer 001; Luciana S. Buriol; Marcus Ritt (IJCAI, 2016)

A bi-objective method of traffic assignment for electric vehicles. - Marcelo de Souza; Marcus Ritt; Ana L. C. Bazzan (ITSC, 2016)

Simulated annealing for the machine reassignment problem. - Gabriel M. Portal; Marcus Ritt; Leonardo Borba; Luciana S. Buriol (Ann. Oper. Res., 2016)

Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. - Alexander J. Benavides; Marcus Ritt (Comput. Oper. Res., 2016)

Pull and PushPull are PSPACE-complete. - André Grahl Pereira; Marcus Ritt; Luciana S. Buriol (Theor. Comput. Sci., 2016)

A genetic algorithm for fair land allocation. - Alex Gliesch; Marcus Ritt; Mayron César O. Moreira (GECCO, 2017)

On the minimization of traffic congestion in road networks with tolls. - Fernando Stefanello; Luciana S. Buriol; Michael J. Hirsch; Panos M. Pardalos; Tania Querido; Mauricio G. C. Resende; Marcus Ritt (Ann. Oper. Res., 2017)

An iterated tabu search for the multi-compartment vehicle routing problem. - Paulo Vitor Silvestrin; Marcus Ritt (Comput. Oper. Res., 2017)

Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops. - Artur Brum; Marcus Ritt (CEC, 2018)

An Automatically Designed Recombination Heuristic for the Test-Assignment Problem. - Marcelo de Souza; Marcus Ritt (CEC, 2018)

Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time. - Artur Brum; Marcus Ritt (EvoCOP, 2018)

A Multistart Alternating Tabu Search for Commercial Districting. - Alex Gliesch; Marcus Ritt; Mayron César O. Moreira (EvoCOP, 2018)

Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming. - Marcelo de Souza; Marcus Ritt (EvoCOP, 2018)

Analyzing Tie-Breaking Strategies for the A* Algorithm. - Augusto B. Corrêa; André Grahl Pereira; Marcus Ritt (IJCAI, 2018)

Fast heuristics for minimizing the makespan in non-permutation flow shops. - Alexander J. Benavides; Marcus Ritt (Comput. Oper. Res., 2018)

A memetic algorithm for the cost-oriented robotic assembly line balancing problem. - Jordi Pereira; Marcus Ritt; Óscar C. Vásquez 001 (Comput. Oper. Res., 2018)

An effective heuristic algorithm for the partial shop scheduling problem. - Tadeu K. Zubaran; Marcus Ritt (Comput. Oper. Res., 2018)

Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem. - Leonardo Borba; Marcus Ritt; Cristóbal Miralles (Eur. J. Oper. Res., 2018)

Improved integer programming models for simple assembly line balancing and related problems. - Marcus Ritt; Alysson M. Costa (Int. Trans. Oper. Res., 2018)

Evolving task priority rules for heterogeneous assembly line balancing. - João Pedro Gonçalves Moreira; Marcus Ritt (CEC, 2019)

A generic approach to districting with diameter or center-based objectives. - Alex Gliesch; Marcus Ritt (GECCO, 2019)

Sequencing Operator Counts with State-Space Search. - Wesley L. Kaizer; André Grahl Pereira; Marcus Ritt (ICAPS, 2020)

A heuristic algorithm for districting problems with similarity constraints. - Alex Gliesch; Marcus Ritt; Arthur H. S. Cruz; Mayron César O. Moreira (CEC, 2020)

A hybrid heuristic for districting problems with routing criteria. - Alex Gliesch; Marcus Ritt; Arthur H. S. Cruz; Mayron César O. Moreira (CEC, 2020)

Heuristic and exact algorithms for minimum-weight non-spanning arborescences. - Marcus Ritt; Jordi Pereira (Eur. J. Oper. Res., 2020)

Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks. - Gustavo Delazeri; Marcus Ritt (CEC, 2021)

Evolving Allocation Rules for Beam Search Heuristics in Assembly Line Balancing. - João Pedro Gonçalves Moreira; Marcus Ritt (EuroGP, 2021)

The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan. - Marcus Ritt; Alexander J. Benavides (GECCO, 2021)

A hybrid heuristic for the maximum dispersion problem. - Alex Gliesch; Marcus Ritt (Eur. J. Oper. Res., 2021)

A Runtime and Non-Intrusive Approach to Optimize EDP by Tuning Threads and CPU Frequency for OpenMP Applications. - Janaina Schwarzrock; Charles Cardoso De Oliveira; Marcus Ritt; Arthur Francisco Lorenzon; Antonio Carlos Schneider Beck (IEEE Trans. Parallel Distributed Syst., 2021)

Efficient configuration of optimization algorithms. - Marcelo de Souza; Marcus Ritt; Manuel López-Ibáñez 001 (GECCO Companion, 2022)

Improved regression models for algorithm configuration. - Marcelo de Souza; Marcus Ritt (GECCO, 2022)

Comparing Surrogate Models for Tuning Optimization Algorithms. - Gustavo Delazeri; Marcus Ritt; Marcelo de Souza (LION, 2022)

Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. - Artur Brum; Rubén Ruiz; Marcus Ritt (Comput. Ind. Eng., 2022)

Capping methods for the automatic configuration of optimization algorithms. - Marcelo de Souza; Marcus Ritt; Manuel López-Ibáñez 001 (Comput. Oper. Res., 2022)

A new heuristic for finding verifiable k-vertex-critical subgraphs. - Alex Gliesch; Marcus Ritt (J. Heuristics, 2022)

Exact and heuristic methods for a workload allocation problem with chain precedence constraints. - Jordi Pereira; Marcus Ritt (Eur. J. Oper. Res., 2023)

Iterated Beam Search for Wildland Fire Suppression. - Gustavo Delazeri; Marcus Ritt (EvoApplications@EvoStar, 2024)

Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations. - Marcus Ritt; Daniel Alejandro Rossit (Comput. Oper. Res., 2024)

Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning. - Rafael Vales Bettker; Pedro Minini; André G. Pereira; Marcus Ritt (J. Artif. Intell. Res., 2024)

New solution approaches for balancing assembly lines with setup times. - Jordi Pereira; Marcus Ritt (Comput. Oper. Res., 2025)