Author of the publication

Four Approximation Algorithms for the Feedback Vertex Set Problem.

, and . WG, page 315-326. Hanser, Munich, (1981)

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.

 

Other publications of authors with the same name

The Complexity of Equilibria for Risk-Modeling Valuations., and . CoRR, (2015)About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines.. Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, page 118-126. Springer, (1975)Local Search: Simple, Successful, But Sometimes Sluggish., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 1-17. Springer, (2010)Broadcasting in Butterfly and DeBruijn Networks., , , and . STACS, volume 577 of Lecture Notes in Computer Science, page 351-362. Springer, (1992)Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs., and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 524-536. Springer, (2001)The Complexity of Determining Paths of Length k.. WG, page 241-251. Universitätsverlag Rudolf Trauner, Linz, (1983)Call for Papers Advances in Computer Chess 9 Conference., and . J. Int. Comput. Games Assoc., 21 (4): 271-272 (1998)Two-Way Multihead Automata Over a One-Letter Alphabet.. RAIRO Theor. Informatics Appl., 14 (1): 67-82 (1980)Note on Optimal Gossiping in Some Weak-Connected Graphs., , and . Theor. Comput. Sci., 127 (2): 395-402 (1994)Minimizing Expectation Plus Variance., and . Theory Comput. Syst., 57 (3): 617-654 (2015)