Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 

Jörg Rothe
Heinrich-Heine-Universität Düsseldorf, Germany

T. Riege, J. Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
/jucs_12_5/completenes_in_the_boolean
page 551 - 578
Vol.12 / Issue 5
J. Rothe, H. Arimura:
Computational Challenges of Massive Data Sets and Randomness in Computation
J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia
/jucs_12_6/computational_challenges_of_massive_data
page 579 - 580
Vol.12 / Issue 6
T. Riege, J. Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
/jucs_12_6/improving_deterministic_and_randomized
page 725 - 745
Vol.12 / Issue 6
L. A. Hemaspaandra, Z. Jiang, J. Rothe, O. Watanabe:
Polynomial-Time Multi-Selectivity
/jucs_3_3/polynomial_time
page 197 - 229
Vol.3 / Issue 3