PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fleischer, Rudolf"

Author of the publication

copydeleteadd this publication to your clipboard
Tight bounds on maximal and maximum matchings.

, , , , and . Discrete Mathematics, 285 (1-3): 7-15 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

apl. Prof. Dr. phil. Rudolf Weber University of Stuttgart

Prof. Dr. -Ing. Rudolf Eligehausen University of Stuttgart

Richard Rudolf University of Stuttgart

Rudolf Fischer University of Stuttgart

Univ. -Prof. Dr. Rudolf Large University of Stuttgart

 

Other publications of authors with the same name

Matching Nuts and Bolts Faster., , and . Inf. Process. Lett., 59 (3): 123-127 (1996)Finding optimal paths in MREP routing., , , and . Inf. Process. Lett., 89 (2): 57-63 (2004)More Efficient Parallel Totally Monotone Matrix Searching., , and . J. Algorithms, 23 (2): 386-400 (1997)A Lower Bound for the Worst Case of Bottom-Up-Heapsort, , and . Inf. Comput., 102 (2): 263-279 (February 1993)Solitaire Clobber., , and . Theor. Comput. Sci., 313 (3): 325-338 (2004)Competitive online searching for a ray in the plane., , , , , and . EuroCG, page 107-110. Technische Universiteit Eindhoven, (2005)Order Preserving Matching, , , , , , , and . CoRR, (2013)Tight Bounds on Maximal and Maximum Matchings., , , , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 308-319. Springer, (2001)Graph Drawing and Its Applications., and . Drawing Graphs, volume 2025 of Lecture Notes in Computer Science, page 1-22. Springer, (1999)Genaue Analyse einiger kombinatorischer Algorithmen.. Saarland University, Saarbrücken, Germany, (1993)