Parallel Architectures: Design and Efficient Use. - Burkhard Monien; Rainer Feldmann; Ralf Klasing; Reinhard Lüling (STACS, 1993)

Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr (WG, 1993)

The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. - Ralf Klasing (MFCS, 1994)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (SWAT, 1994)

Broadcasting in Butterfly and deBruijn Networks. - Ralf Klasing; Burkhard Monien; Regine Peine; Elena Stöhr (Discret. Appl. Math., 1994)

The Complexity of Systolic Dissemination of Information in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener; Dana Pardubská (RAIRO Theor. Informatics Appl., 1994)

Efficient Use of Parallel & Distributed Systems: From Theory to Practice. - Burkhard Monien; Ralf Diekmann; Rainer Feldmann; Ralf Klasing; Reinhard Lüling; Knut Menzel; Thomas Römke; Ulf-Peter Schroeder (Computer Science Today, 1995)

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Walter Unger; Juraj Waczulík; Hubert Wagener (FCT, 1995)

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Krzysztof Lorys; Przemyslawa Kanarek; Ralf Klasing; Walter Unger; Hubert Wagener (STACS, 1995)

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr; Hubert Wagener (Inf. Comput., 1995)

On the Complexity of Broadcast and Gossip in Different Communication Modes. - Ralf Klasing (Verlag Shaker, Aachen, 1996)

Dissemination of Information in Vertex-Disjoint Paths Mode. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr (Comput. Artif. Intell., 1996)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (Inf. Comput., 1997)

The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. - Ralf Klasing (Discret. Appl. Math., 1998)

Optimal Embedding of Complete Binary Trees into Lines and Grids. - Ralf Heckmann; Ralf Klasing; Burkhard Monien; Walter Unger (J. Parallel Distributed Comput., 1998)

Compressing cube-connected cycles and butterfly networks. - Ralf Klasing; Reinhard Lüling; Burkhard Monien (Networks, 1998)

Effective Systolic Algorithms for Gossiping in Cycles. - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Juraj Waczulík; Hubert Wagener (Parallel Process. Lett., 1998)

Improved Compressions of Cube-Connected Cycles Networks. - Ralf Klasing (IEEE Trans. Parallel Distributed Syst., 1998)

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (STACS, 2000)

Approximation algorithms for the TSP with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (Inf. Process. Lett., 2000)

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2002)

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (CIAC, 2003)

Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. - Ralf Klasing; Alfredo Navarra; Aris A. Papadopoulos; Stephane Perennes (NETWORKING, 2004)

Dominating Sets in Web Graphs. - Colin Cooper; Ralf Klasing; Michele Zito 001 (WAW, 2004)

Hardness results and approximation algorithms of k-tuple domination in graphs. - Ralf Klasing; Christian Laforest (Inf. Process. Lett., 2004)

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2004)

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance - Juraj Hromkovic; Ralf Klasing; Andrzej Pelc; Peter Ruzicka; Walter Unger (Springer, 2005)

Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (SIROCCO, 2005)

Lower Bounds and Algorithms for Dominating Sets in Web Graphs. - Colin Cooper; Ralf Klasing; Michele Zito 001 (Internet Math., 2005)

Searching for Black-Hole Faults in a Network Using Multiple Agents. - Colin Cooper; Ralf Klasing; Tomasz Radzik (OPODIS, 2006)

Constructing Incremental Sequences in Graphs. - Ralf Klasing; Christian Laforest; Joseph G. Peters; Nicolas Thibault (Algorithmic Oper. Res., 2006)

Hardness and Approximation of Gathering in Static Radio Networks. - Jean-Claude Bermond; Jérôme Galtier; Ralf Klasing; Nelson Morales; Stephane Perennes (Parallel Process. Lett., 2006)

Cost Minimisation in Multi-interface Networks. - Ralf Klasing; Adrian Kosowski; Alfredo Navarra (NET-COOP, 2007)

On the Complexity of Distributed Greedy Coloring. - Cyril Gavoille; Ralf Klasing; Adrian Kosowski; Alfredo Navarra (DISC, 2007)

Improved Approximation Results for the Minimum Energy Broadcasting Problem. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Algorithmica, 2007)

Hardness and approximation results for Black Hole Search in arbitrary networks. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (Theor. Comput. Sci., 2007)

Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. - Ralf Klasing; Adrian Kosowski; Alfredo Navarra (OPODIS, 2008)

Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. - Sylvain Gravier; Ralf Klasing; Julien Moncel (Algorithmic Oper. Res., 2008)

Fast periodic graph exploration with constant memory. - Leszek Gasieniec; Ralf Klasing; Russell A. Martin; Alfredo Navarra; Xiaohui Zhang 004 (J. Comput. Syst. Sci., 2008)

On k-connectivity problems with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (J. Discrete Algorithms, 2008)

Approximation bounds for Black Hole Search problems. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (Networks, 2008)

A randomized algorithm for the joining protocol in dynamic distributed networks. - Colin Cooper; Ralf Klasing; Tomasz Radzik (Theor. Comput. Sci., 2008)

Gathering asynchronous oblivious mobile robots in a ring. - Ralf Klasing; Euripides Markou; Andrzej Pelc (Theor. Comput. Sci., 2008)

On the complexity of bandwidth allocation in radio networks. - Ralf Klasing; Nelson Morales; Stéphane Pérennes (Theor. Comput. Sci., 2008)

Tightening the upper bound for the minimum energy broadcasting. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Wirel. Networks, 2008)

Robustness of the Rotor-router Mechanism. - Evangelos Bampas; Leszek Gasieniec; Ralf Klasing; Adrian Kosowski; Tomasz Radzik (OPODIS, 2009)

Euler Tour Lock-In Problem in the Rotor-Router Model. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski (DISC, 2009)

From Balls and Bins to Points and Vertices. - Ralf Klasing; Zvi Lotker; Alfredo Navarra; Stéphane Pérennes (Algorithmic Oper. Res., 2009)

On the complexity of distributed graph coloring with local minimality constraints. - Cyril Gavoille; Ralf Klasing; Adrian Kosowski; Lukasz Kuszner; Alfredo Navarra (Networks, 2009)

Cost minimization in wireless networks with a bounded and unbounded number of interfaces. - Ralf Klasing; Adrian Kosowski; Alfredo Navarra (Networks, 2009)

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Przemyslawa Kanarek; Ralf Klasing; Krzysztof Lorys; Walter Unger; Hubert Wagener (SIAM J. Discret. Math., 2009)

Data Gathering in Wireless Networks. - Vincenzo Bonifaci; Ralf Klasing; Peter Korteweg; Leen Stougie; Alberto Marchetti-Spaccamela (Graphs and Algorithms in Communication Networks, 2010)

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. - Alfredo Navarra; Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Ralf Klasing (Graphs and Algorithms in Communication Networks, 2010)

Improved Approximations for TSP with Simple Precedence Constraints. - Hans-Joachim Böckenhauer; Ralf Klasing; Tobias Mömke; Monika Steinová (CIAC, 2010)

Locating and repairing faults in a network with mobile agents. - Colin Cooper; Ralf Klasing; Tomasz Radzik (Theor. Comput. Sci., 2010)

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. - Ralf Klasing; Adrian Kosowski; Alfredo Navarra (Theor. Comput. Sci., 2010)

Derandomizing random walks in undirected graphs using locally fair exploration strategies. - Colin Cooper; David Ilcinkas; Ralf Klasing; Adrian Kosowski (Distributed Comput., 2011)

Gathering of Robots on Anonymous Grids without Multiplicity Detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (SIROCCO, 2012)

On the size of identifying codes in triangle-free graphs. - Florent Foucaud; Ralf Klasing; Adrian Kosowski; André Raspaud (Discret. Appl. Math., 2012)

More efficient periodic traversal in anonymous undirected graphs. - Jurek Czyzowicz; Stefan Dobrev; Leszek Gasieniec; David Ilcinkas; Jesper Jansson 001; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2012)

Efficient Exploration of Anonymous Undirected Graphs. - Ralf Klasing (IWOCA, 2013)

Gathering Radio Messages in the Path. - Jean-Claude Bermond; Ralf Klasing; Nelson Morales; Stéphane Pérennes; Patricio Reyes (Discret. Math. Algorithms Appl., 2013)

Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. - David Ilcinkas; Ralf Klasing; Ahmed Mouhamadou Wade (SIROCCO, 2014)

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (CoRR, 2014)

Editorial. - Ralf Klasing (ACM J. Exp. Algorithmics, 2014)

Centroidal bases in graphs. - Florent Foucaud; Ralf Klasing; Peter J. Slater (Networks, 2014)

Efficiently Testing T -Interval Connectivity in Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (CIAC, 2015)

Network verification via routing table queries. - Evangelos Bampas; Davide Bilò; Guido Drovandi; Luciano Gualà; Ralf Klasing; Guido Proietti (J. Comput. Syst. Sci., 2015)

Rendezvous of heterogeneous mobile agents in edge-weighted networks. - Dariusz Dereniowski; Ralf Klasing; Adrian Kosowski; Lukasz Kuszner (Theor. Comput. Sci., 2015)

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? - Ralf Klasing; Adrian Kosowski; Dominik Pajak (SIROCCO, 2016)

Gathering of robots on anonymous grids and trees without multiplicity detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (Theor. Comput. Sci., 2016)

On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (CIAC, 2017)

The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (COCOON, 2017)

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (SIROCCO, 2017)

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). - Leszek Gasieniec; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (SOFSEM, 2017)

Robustness of the Rotor-Router Mechanism. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski; Tomasz Radzik (Algorithmica, 2017)

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. - Ralf Klasing; Adrian Kosowski; Dominik Pajak; Thomas Sauerwald (Distributed Comput., 2017)

Collision-free network exploration. - Jurek Czyzowicz; Dariusz Dereniowski; Leszek Gasieniec; Ralf Klasing; Adrian Kosowski; Dominik Pajak (J. Comput. Syst. Sci., 2017)

Parameterized and approximation complexity of the detection pair problem in graphs. - Florent Foucaud; Ralf Klasing (J. Graph Algorithms Appl., 2017)

A Modern View on Stability of Approximation. - Ralf Klasing; Tobias Mömke (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (IWOCA, 2018)

Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. - Li-Hsuan Chen; Dun-Wei Cheng; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (J. Comput. Syst. Sci., 2018)

Linear Search by a Pair of Distinct-Speed Robots. - Evangelos Bampas; Jurek Czyzowicz; Leszek Gasieniec; David Ilcinkas; Ralf Klasing; Tomasz Kociumaka; Dominik Pajak (Algorithmica, 2019)

Computing Parameters of Sequence-Based Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (Theory Comput. Syst., 2019)

Improved Analysis of Deterministic Load-Balancing Schemes. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (ACM Trans. Algorithms, 2019)

Monitoring the Edges of a Graph Using Distances. - Florent Foucaud; Ralf Klasing; Mirka Miller; Joe Ryan 001 (CALDAM, 2020)

The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. - Shih-Chia Chang; Li-Hsuan Chen; Ling-Ju Hung; Shih-Shun Kao; Ralf Klasing (ICS, 2020)

Top-Down Construction of Independent Spanning Trees in Alternating Group Networks. - Jie-Fu Huang; Shih-Shun Kao; Sun-Yuan Hsieh; Ralf Klasing (IEEE Access, 2020)

IWOCA 2020 in Bordeaux (Oops! On-Line!). - Florent Foucaud; Leszek Gasieniec; Ralf Klasing; Tomasz Radzik; Bill Smyth (Bull. EATCS, 2020)

Vulnerability of super extra edge-connected graphs. - Chia-Wen Cheng; Sun-Yuan Hsieh; Ralf Klasing (J. Comput. Syst. Sci., 2020)

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. - Ralf Klasing; Marc Zeitoun (J. Comput. Syst. Sci., 2020)

Beachcombing on strips and islands. - Evangelos Bampas; Jurek Czyzowicz; David Ilcinkas; Ralf Klasing (Theor. Comput. Sci., 2020)

Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (Theor. Comput. Sci., 2020)

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. - Shih-Shun Kao; Ralf Klasing; Ling-Ju Hung; Sun-Yuan Hsieh (AAIM, 2021)

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. - Yi-Cheng Yang; Shih-Shun Kao; Ralf Klasing; Sun-Yuan Hsieh; Hsin-Hung Chou; Jou-Ming Chang (IEEE Access, 2021)

On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (Algorithmica, 2022)

Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. - Leszek Gasieniec; Ralf Klasing; Tomasz Radzik (Algorithmica, 2022)

Perpetual maintenance of machines with different urgency requirements. - Leszek Gasieniec; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (CoRR, 2022)

On the distance-edge-monitoring numbers of graphs. - Chengxu Yang; Ralf Klasing; Yaping Mao; Xingchao Deng (CoRR, 2022)

Monitoring the edges of a graph using distances. - Florent Foucaud; Shih-Shun Kao; Ralf Klasing; Mirka Miller; Joe Ryan 001 (Discret. Appl. Math., 2022)

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs. - Hao-Ping Yeh; Wei Lu; Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing; Sun-Yuan Hsieh (Theor. Comput. Sci., 2022)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. - Romaric Duvignau; Ralf Klasing (LAGOS, 2023)

Constructing disjoint Steiner trees in Sierpiński graphs. - Chenxu Yang; Ping Li 025; Yaping Mao; Eddie Cheng 001; Ralf Klasing (CoRR, 2023)

The RED-BLUE SEPARATION problem on graphs. - Subhadeep Ranjan Dev; Sanjana Dey; Florent Foucaud; Ralf Klasing; Tuomo Lehtilä (Theor. Comput. Sci., 2023)

A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. - Shih-Shun Kao; Ralf Klasing; Ling-Ju Hung; Chia-Wei Lee; Sun-Yuan Hsieh (J. Parallel Distributed Comput., 2023)

Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. - Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing (AAIM (2), 2024)

Algorithms and Complexity for Path Covers of Temporal DAGs. - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (MFCS, 2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (CoRR, 2024)

Perturbation Results for Distance-edge-monitoring Numbers. - Chenxu Yang; Ralf Klasing; Changxiang He; Yaping Mao (Fundam. Informaticae, 2024)

The number of spanning trees for Sierpiński graphs and data center networks. - Xiaojuan Zhang; Gang Yang; Changxiang He; Ralf Klasing; Yaping Mao (Inf. Comput., 2024)

The g-extra connectivity of graph products. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing; Yuzhi Xiao (J. Comput. Syst. Sci., 2024)

Monitoring the edges of a graph using distances with given girth. - Chenxu Yang; Gang Yang; Sun-Yuan Hsieh; Yaping Mao; Ralf Klasing (J. Comput. Syst. Sci., 2024)

Erdös-Gallai-type problems for distance-edge-monitoring numbers. - Zhen Ji; Ralf Klasing; Wen Li; Yaping Mao; Xiaoyan Zhang 001 (Discret. Appl. Math., 2024)

On the distance-edge-monitoring numbers of graphs. - Chenxu Yang; Ralf Klasing; Yaping Mao; Xingchao Deng (Discret. Appl. Math., 2024)

Perpetual maintenance of machines with different urgency requirements. - Leszek Gasieniec; Tomasz Jurdzinski; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (J. Comput. Syst. Sci., 2024)

Geographical Peer Matching for P2P Energy Sharing. - Romaric Duvignau; Vincenzo Gulisano; Marina Papatriantafilou; Ralf Klasing (IEEE Access, 2025)

The distance-edge-monitoring numbers of subdivision graphs. - Zhen Ji; Zhiwei Guo; Eddie Cheng 001; Ralf Klasing; Yaping Mao (Discret. Appl. Math., 2025)

Linear programming of monitoring the links of a fractional weighted network using distance. - Wen Li; Yaping Mao; Ralf Klasing (Inf. Comput., 2025)

Monitoring the edges of product networks using distances. - Wen Li; Ralf Klasing; Yaping Mao; Bo Ning 001 (J. Comput. Syst. Sci., 2025)

Graph Exploration with Edge Weight Estimates. - Matthias Gehnen; Ralf Klasing; Émile Naquin (CoRR, 2025)

Fault-tolerance in distance-edge-monitoring sets. - Chenxu Yang; Yaping Mao; Ralf Klasing; Gang Yang; Yuzhi Xiao; Xiaoyan Zhang (Acta Informatica, 2025)

The g-good-neighbor diagnosability of product networks under the PMC model. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing (CoRR, 2025)

Online Unbounded Knapsack. - Hans-Joachim Böckenhauer; Matthias Gehnen; Juraj Hromkovic; Ralf Klasing; Dennis Komm; Henri Lotze; Daniel Mock; Peter Rossmanith; Moritz Stocker (Theory Comput. Syst., 2025)

Greediness is not always a vice: Efficient discovery algorithms for assignment problems. - Romaric Duvignau; Noël Gillet; Ralf Klasing (Discret. Appl. Math., 2026)

Online knapsack with removal and recourse. - Hans-Joachim Böckenhauer; Ralf Klasing; Tobias Mömke; Peter Rossmanith; Moritz Stocker; David Wehner (J. Comput. Syst. Sci., 2026)