@misc{MueskeKirschnerScheffleretal., author = {M{\"u}ske, Carina and Kirschner, Jana and Scheffler, Bettina and Michel, Sven and Prill, Robert}, title = {Effects of treadmill training compared to conventional physiotherapy, other treadmilltraining or no intervention on gait cycle parameters stride length and walking speed, gait capacity and fatigue of patients with multiple sclerosis}, series = {The International Disabled People`s Day - XXVth edition - Life without Pain / Healthy Children - Healthy Europe}, journal = {The International Disabled People`s Day - XXVth edition - Life without Pain / Healthy Children - Healthy Europe}, publisher = {Oficyna Wydawnicza Klubu Literackiego "Inspiracje"}, address = {Zgorzelec}, isbn = {978-83-88380-77-8}, pages = {S. 51}, abstract = {Multiple sclerosis is the most common neurological disease of young adults leading to permanent disability and early retirement. There are currently about 224,000 people affected in Germany. The disease is an inflammatory autoimmune disease with a broad spectrum of symptoms. The most common symptoms are fatigue and walking disabilities. Approximately 75\% of patients suffer from difficulties in movement and balance, which lead to postural stability, walking ability and an increased risk of falling. 80 - 97\% of those affected also suffer from fatigue symptoms. Both gait disorders and fatigue have the greatest negative effects on the quality of life and activities of daily life. The review shows, how treadmill training of different types affects the gait parameters stride length and walking speed; gait capacity and fatigue in patients with multiple sclerosis of all types and disability rates compared to no intervention, other treadmill training or conventional physiotherapy and how it should be dosed. Nine studies with a total of 294 participants will be evaluated in this systematic review. The study results are categorized according to their type of training. Compared to no intervention, conventional treadmill training shows significant improvements in walking speed and partial in fatigue and gait capacity. Furthermore, it indicates that treadmill training with negative slope achieves significantly better results in gait capacity and fatigue. The comparison of treadmill training with Virtual Reality shows no advantage over conventional treadmill training and a robot-supported treadmill training does not show any superiority over conventional gait training. Treadmill training is an adequate alternative to conventional gait training in physiotherapy. The study situation is very rare and is not sufficient to completely determine the effects of treadmill training in multiple sclerosis. Further high-quality studies will be needed to investigate the effects of treadmill training on a larger sample size compared to conventional gait training or other treadmill training in patients with impaired walking ability and to examine the effects of training on a more homogeneous group of participants. Thus, possible interindividual differences between the different types of MS and disabilities could be identified and more specific conclusions could be drawn.}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {On the recognition of search trees generated by BFS and DFS}, series = {Theoretical Computer Science}, volume = {936}, journal = {Theoretical Computer Science}, issn = {0304-3975}, doi = {https://doi.org/10.1016/j.tcs.2022.09.018}, pages = {116 -- 128}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {Linearizing Partial Search Orders}, series = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, T{\"u}bingen, Germany, June 22-24, 2022}, journal = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, T{\"u}bingen, Germany, June 22-24, 2022}, publisher = {Springer}, address = {Cham}, isbn = {978-3-031-15913-8}, doi = {10.1007/978-3-031-15914-5_31}, pages = {425 -- 438}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {The Distance Orientation Problem}, series = {Discrete Applied Mathematics}, volume = {323}, journal = {Discrete Applied Mathematics}, issn = {0166-218X}, doi = {10.1016/j.dam.2022.06.009}, pages = {324 -- 342}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {Recognizing LBFS trees of bipartite graphs}, series = {Information Processing Letters}, volume = {186}, journal = {Information Processing Letters}, issn = {0020-0190}, doi = {10.1016/j.ipl.2024.106483}, language = {en} } @misc{JahnkeCruysenPrilletal., author = {Jahnke, Sonja and Cruysen, Caren and Prill, Robert and Kittmann, Fabian and Pflug, Nicola and Albert, Justin Amadeus and Camargo, Tibor de and Arnrich, Bert and Krolikowska, Aleksandra and Kolcz, Anna and Reichert, Pawel and Oleksy, Lukasz and Michel, Sven and Kopf, Sebastian and Wagner, Michael and Scheffler, Sven and Becker, Roland}, title = {Protocol for a Randomized Crossover Trial to Evaluate the Effect of Soft Brace and Rigid Orthosis on Performance and Readiness to Return to Sport Six Months Post‑ACL‑Reconstruction}, series = {Healthcare}, volume = {11}, journal = {Healthcare}, number = {4}, issn = {2227-9032}, doi = {10.3390/healthcare11040513}, abstract = {A randomized crossover trial was designed to investigate the influence of muscle activation and strength on functional stability/control of the knee joint, to determine whether bilateral imbalances still occur six months after successful anterior cruciate ligament reconstruction (ACLR), and to analyze whether the use of orthotic devices changes the activity onset of these muscles. Furthermore, conclusions on the feedforward and feedback mechanisms are highlighted. Therefore, twenty‑eight patients will take part in a modified Back in Action (BIA) test battery at an average of six months after a primary unilateral ACLR, which used an autologous ipsilateral semitendinosus tendon graft. This includes double‑leg and single‑leg stability tests, double‑leg and single‑leg countermovement jumps, double‑leg and single‑leg drop jumps, a speedy jump test, and a quick feet test. During the tests, gluteus medius and semitendinosus muscle activity are analyzed using surface electromyography (sEMG). Motion analysis is conducted using Microsoft Azure DK and 3D force plates. The tests are performed while wearing knee rigid orthosis, soft brace, and with no aid, in random order. Additionally, the range of hip and knee motion and hip abductor muscle strength under isometric conditions are measured. Furthermore, patient‑rated outcomes will be assessed.}, language = {en} } @misc{KoehlerRoggeScheffleretal., author = {K{\"o}hler, Ekkehard and Rogge, Markus and Scheffler, Robert and Strehler, Martin}, title = {Optimal Bicycle Routes with Few Signal Stops}, series = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)}, volume = {OASIcs - Open Access Series in Informatics; Band 115}, journal = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl}, issn = {978-3-95977-302-7}, doi = {10.4230/OASIcs.ATMOS.2023.1}, pages = {1:1 -- 1:14}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {Graph Search Trees and Their Leaves}, series = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023}, journal = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023}, publisher = {Springer}, address = {Cham}, isbn = {978-3-031-43379-5}, doi = {10.1007/978-3-031-43380-1_33}, pages = {462 -- 476}, language = {en} } @misc{BeisegelChiarelliKoehleretal., author = {Beisegel, Jesse and Chiarelli, Nina and K{\"o}hler, Ekkehard and Milanič, Martin and Muršič, Peter and Scheffler, Robert}, title = {The simultaneous interval number: a new width parameter that measures the similarity to interval graphs}, series = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, journal = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl}, isbn = {978-3-95977-318-8}, doi = {10.4230/LIPIcs.SWAT.2024.7}, pages = {7:1 -- 7:20}, language = {en} } @misc{BeisegelKoehlerRatajczaketal., author = {Beisegel, Jesse and K{\"o}hler, Ekkehard and Ratajczak, Fabienne and Scheffler, Robert and Strehler, Martin}, title = {Graph search trees and the intermezzo problem}, series = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, journal = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, editor = {Kr{\´a}lovič, Rastislav and Kučera, Anton{\´i}n}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl}, isbn = {978-3-95977-335-5}, doi = {10.4230/LIPICS.MFCS.2024.22}, pages = {22:1 -- 22:18}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {Semi-proper interval graphs}, series = {Discrete Applied Mathematics}, volume = {360}, journal = {Discrete Applied Mathematics}, issn = {0166-218X}, doi = {10.1016/j.dam.2024.08.016}, pages = {22 -- 41}, language = {en} } @misc{BeisegelRatajczakScheffler, author = {Beisegel, Jesse and Ratajczak, Fabienne and Scheffler, Robert}, title = {Computing hamiltonian paths with partial order restrictions}, series = {ACM Transactions on Computation Theory}, volume = {17}, journal = {ACM Transactions on Computation Theory}, number = {1}, issn = {1942-3454}, doi = {10.1145/3711844}, pages = {1 -- 24}, abstract = {When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example, one could decide whether a Hamiltonian path exists for a fixed starting point, or that some vertices are visited before another vertex. We consider the problem of finding a Hamiltonian path that observes all precedence constraints given in a partial order on the vertex set. We show that this problem is NP-complete even if restricted to complete bipartite graphs and posets of height 2. In contrast, for posets of width k there is a known O(k^2 n^k) algorithm for arbitrary graphs with n vertices. We show that it is unlikely that the running time of this algorithm can be improved significantly, i.e., there is no f(k) n^o(k) time algorithm under the assumption of the Exponential Time Hypothesis. Furthermore, for the class of outerplanar graphs, we give an O(n^2) algorithm for arbitrary posets.}, language = {en} } @misc{BeisegelKoehlerScheffleretal., author = {Beisegel, Jesse and K{\"o}hler, Ekkehard and Scheffler, Robert and Strehler, Martin}, title = {Certifying fully dynamic algorithms for recognition and Hamiltonicity of Threshold and Chain Graphs}, series = {Algorithmica}, volume = {85}, journal = {Algorithmica}, number = {8}, issn = {0178-4617}, doi = {10.1007/s00453-023-01107-1}, pages = {2454 -- 2481}, language = {en} } @misc{SchefflerStrehlerVargasKoch, author = {Scheffler, Robert and Strehler, Martin and Vargas Koch, Laura}, title = {Routing Games with Edge Priorities}, series = {ACM Transactions on Economics and Computation}, volume = {10}, journal = {ACM Transactions on Economics and Computation}, number = {1}, issn = {2167-8375}, doi = {10.1145/3488268}, pages = {1:1 -- 1:27}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {The partial search order problem}, series = {The electronic journal of combinatorics}, volume = {32}, journal = {The electronic journal of combinatorics}, number = {4}, issn = {1077-8926}, doi = {10.37236/12654}, pages = {1 -- 37}, abstract = {In recent years, questions about the construction of special orderings of a given graph search were studied by several authors. On the one hand, the so called end-vertex problem introduced by Corneil et al. in 2010 asks for search orderings ending in a particular vertex. On the other hand, the problem of finding orderings that induce a given search tree was introduced already in the 1980s by Hagerup and received new attention most recently. Here, we consider a generalization of some of these problems by studying the question whether there is a search ordering that is a linear extension of a given partial order on a graph's vertex set. We show that this problem can be solved in polynomial time for Generic Search on general graphs as well as for searches called forgetful and partial orders of bounded width. Furthermore, we present polynomial-time algorithms on the classes of chordal bipartite graphs and split graphs for some searches including (Lexicographic) Breadth First Search. These algorithms generalize known algorithmic results for the End-Vertex Problem and the Search Tree Recognition Problem.}, language = {en} } @misc{Scheffler, author = {Scheffler, Robert}, title = {On the leaves of graph search trees}, series = {Ars Mathematica Contemporanea}, volume = {26}, journal = {Ars Mathematica Contemporanea}, number = {1}, publisher = {University of Primorska Press}, address = {Koper}, issn = {1855-3974}, doi = {10.26493/1855-3974.3238.2a8}, pages = {1 -- 29}, abstract = {Graph searches and their respective search trees are widely used in algorithmic graph theory. The problem whether a given spanning tree can be a graph search tree has been considered for different searches, graph classes and search tree paradigms. Similarly, the question whether a particular vertex can be visited last by some search has been studied extensively in recent years. We combine these two problems by considering the question whether a vertex can be a leaf of a graph search tree. We show that for particular search trees, including DFS trees, this problem is easy if we allow the leaf to be the first vertex of the search ordering. We contrast this result by showing that the problem becomes hard for many searches, including DFS and BFS, if we forbid the leaf to be the first vertex. Additionally, we present several structural and algorithmic results for search tree leaves of chordal graphs.}, language = {en} } @misc{BeisegelKlostKnorretal., author = {Beisegel, Jesse and Klost, Katharina and Knorr, Kristin and Ratajczak, Fabienne and Scheffler, Robert}, title = {A graph width perspective on partially ordered Hamiltonian paths and cycles II : vertex and edge deletion numbers}, series = {20th International Symposium on Parameterized and Exact Computation (IPEC 2025)}, journal = {20th International Symposium on Parameterized and Exact Computation (IPEC 2025)}, editor = {Agrawal, Akanksha and van Leeuwen, Erik Jan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Wadern}, isbn = {978-3-95977-407-9}, doi = {10.4230/LIPIcs.IPEC.2025.30}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-251623}, pages = {30:1 -- 30:19}, abstract = {We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems Hamiltonian Path and Hamiltonian Cycle are in FPT. In particular, we focus on parameters that describe how many vertices and edges have to be deleted to become a member of a certain graph class. We show that the problems are W[1]-hard for such restricted cases as vertex distance to path and vertex distance to clique. We complement these results by showing that the problems can be solved in XP time for vertex distance to outerplanar and vertex distance to block. Furthermore, we present some FPT algorithms, e.g., for edge distance to block. Additionally, we prove para-NP-hardness when considered with the edge clique cover number.}, language = {en} }