Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Jörg
    Last name: Rothe
    DBLP: r/JorgRothe
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 161  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe.
    The complexity of probabilistic lobbying.
    Discrete Optimization 2014, Volume 11 (0) 2014
    Journal article
    Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe.
    Computational complexity and approximability of social welfare optimization in multiagent resource allocation.
    Autonomous Agents and Multi-Agent Systems 2014, Volume 28 (0) 2014
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The complexity of online manipulation of sequential elections.
    J. Comput. Syst. Sci. 2014, Volume 80 (0) 2014
    Conference paper
    Anja Rey, Jörg Rothe.
    False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time.
    LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings 2014 (0) 2014
    Journal article
    Anja Rey, Jörg Rothe.
    False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe.
    The Complexity of Computing Minimal Unidirectional Covering Sets.
    Theory Comput. Syst. 2013, Volume 53 (0) 2013
    Conference paper
    Trung Thanh Nguyen 0004, Jörg Rothe.
    Envy-ratio and average-nash social welfare optimization in multiagent resource allocation.
    International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, May 6-10, 2013 2013 (0) 2013
    Journal article
    Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend.
    Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The Complexity of Online Manipulation of Sequential Elections.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe.
    Computational Aspects of Manipulation and Control in Judgment Aggregation.
    Algorithmic Decision Theory - Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings 2013 (0) 2013
    Conference paper
    Trung Thanh Nguyen 0004, Jörg Rothe.
    How to Decrease the Degree of Envy in Allocations of Indivisible Goods.
    Algorithmic Decision Theory - Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings 2013 (0) 2013
    Journal article
    Jörg Rothe, Lena Schend.
    Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey.
    Ann. Math. Artif. Intell. 2013, Volume 68 (0) 2013
    Conference paper
    Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe.
    A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation.
    Ann. Math. Artif. Intell. 2013, Volume 68 (0) 2013
    Journal article
    Judy Goldsmith, Jörg Rothe.
    Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface.
    Ann. Math. Artif. Intell. 2013, Volume 68 (0) 2013
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.
    Inf. Process. Lett. 2012, Volume 112 (0) 2012
    Conference paper
    Jörg Rothe, Lena Schend.
    Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.
    International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012 2012 (0) 2012
    Conference paper
    Nhan-Tam Nguyen, Magnus Roos, Jörg Rothe.
    Exact Optimization of Social Welfare by the Nash Product is DP-Complete.
    International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012 2012 (0) 2012
    Conference paper
    Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe.
    A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation.
    International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012 2012 (0) 2012
    Conference paper
    Jörg Rothe, Lena Schend.
    Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.
    Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia.
    The Possible Winner Problem with Uncertain Weights.
    ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012 2012 (0) 2012
    Conference paper
    Anja Rey, Jörg Rothe.
    Probabilistic Path-Disruption Games.
    ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012 2012 (0) 2012
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Online Voter Control in Sequential Elections.
    ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012 2012 (0) 2012
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Controlling Candidate-Sequential Elections.
    ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012 2012 (0) 2012
    Conference paper
    Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe.
    Campaigns for lazy voters: truncated ballots.
    International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes) 2012 (0) 2012
    Conference paper
    Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe.
    Complexity and approximability of social welfare optimization in multiagent resource allocation.
    International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes) 2012 (0) 2012
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Online Voter Control in Sequential Elections
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Jörg Rothe, Lena Schend.
    Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Controlling Candidate-Sequential Elections
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The Complexity of Online Manipulation of Sequential Elections
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Anja Rey, Jörg Rothe.
    Probabilistic Path-Disruption Games.
    STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, Montpellier, France, 27-28 August 2012 2012 (0) 2012
    Conference paper
    Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe.
    Control in Judgment Aggregation.
    STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, Montpellier, France, 27-28 August 2012 2012 (0) 2012
    Conference paper
    Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Jörg Rothe.
    Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation.
    STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, Montpellier, France, 27-28 August 2012 2012 (0) 2012
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.
    Inf. Comput. 2011, Volume 209 (0) 2011
    Journal article
    Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe.
    Control Complexity in Bucklin and Fallback Voting
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Magnus Roos, Jörg Rothe, Björn Scheuermann.
    How to Calibrate the Scores of Biased Reviewers by Quadratic Programming.
    Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011 2011 (0) 2011
    Journal article
    Dorothea Baumeister, Jörg Rothe.
    Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe.
    How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.
    Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Anja Rey, Jörg Rothe.
    Bribery in Path-Disruption Games.
    Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Gábor Erdélyi, Lena Piras, Jörg Rothe.
    The complexity of voter partition in Bucklin and fallback voting: solving three open problems.
    10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3 2011 (0) 2011
    Conference paper
    Dorothea Baumeister, Magnus Roos, Jörg Rothe.
    Computational complexity of two variants of the possible winner problem.
    10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3 2011 (0) 2011
    Conference paper
    Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe.
    The Complexity of Computing Minimal Unidirectional Covering Sets.
    Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings 2010 (0) 2010
    Journal article
    Gábor Erdélyi, Lena Piras, Jörg Rothe.
    Bucklin Voting is Broadly Resistant to Control
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Anja Rey, Jörg Rothe.
    Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games.
    ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings 2010 (0) 2010
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.
    ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings 2010 (0) 2010
    Conference paper
    Magnus Roos, Jörg Rothe.
    Complexity of social welfare optimization in multiagent resource allocation.
    (0) 2010
    Conference paper
    Anja Rey, Jörg Rothe.
    Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs.
    STAIRS 2010 - Proceedings of the Fifth Starting AI Researchers' Symposium, Lisbon, Portugal, 16-20 August, 2010 2010 (0) 2010
    Conference paper
    Gábor Erdélyi, Jörg Rothe.
    Control Complexity in Fallback Voting.
    Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010 2010 (0) 2010
    Journal article
    Gábor Erdélyi, Lena Piras, Jörg Rothe.
    Control Complexity in Fallback Voting
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.
    J. Artif. Intell. Res. (JAIR) 2009, Volume 35 (0) 2009
    Conference paper
    Yoram Bachrach, Reshef Meir, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein.
    The cost of stability in weighted voting games.
    8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 2 2009 (0) 2009
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The shield that never was: societies with single-peaked preferences are more open to manipulation and control.
    Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009 2009 (0) 2009
    Conference paper
    Claudia Lindner, Jörg Rothe.
    Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols.
    Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein.
    The Cost of Stability in Coalitional Games.
    Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Binkele-Raible, Jörg Rothe.
    The Complexity of Probabilistic Lobbying.
    Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe.
    Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Claudia Lindner, Jörg Rothe.
    Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Binkele-Raible, Jörg Rothe.
    The Complexity of Probabilistic Lobbying
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein.
    The Cost of Stability in Coalitional Games
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    Satisfiability Parsimoniously Reduces to the Tantrix
    Fundam. Inform. 2009, Volume 91 (0) 2009
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    The three-color and two-color Tantrix
    Inf. Comput. 2009, Volume 207 (0) 2009
    Conference paper
    Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski.
    Frequency of correctness versus average polynomial time.
    Inf. Process. Lett. 2009, Volume 109 (0) 2009
    Conference paper
    Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski.
    Generalized juntas and NP-hard sets.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Journal article
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.
    Math. Log. Q. 2009, Volume 55 (0) 2009
    Journal article
    Gábor Erdélyi, Markus Nowak, Jörg Rothe.
    Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control.
    Math. Log. Q. 2009, Volume 55 (0) 2009
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Copeland Voting Fully Resists Constructive Control.
    Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Gábor Erdélyi, Markus Nowak, Jörg Rothe.
    Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control.
    Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.
    Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers 2008 (0) 2008
    Conference paper
    Gábor Erdélyi, Markus Nowak, Jörg Rothe.
    Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski.
    Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Llull and Copeland Voting Computationally Resist Bribery and Control
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena.
    Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions.
    Theor. Comput. Sci. 2008, Volume 401 (0) 2008
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Llull and Copeland Voting Broadly Resist Bribery and Control.
    Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22-26, 2007, Vancouver, British Columbia, Canada 2007 (0) 2007
    Conference paper
    Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski.
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
    Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.
    IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 2007 (0) 2007
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    Satisfiability Parsimoniously Reduces to the Tantrix
    Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Anyone but him: The complexity of precluding an alternative.
    Artif. Intell. 2007, Volume 171 (0) 2007
    Conference paper
    Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski.
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Dorothea Baumeister, Jörg Rothe.
    The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Copeland Voting Fully Resists Constructive Control
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe.
    Quantum cryptography: A survey.
    ACM Comput. Surv. 2007, Volume 39 (0) 2007
    Conference paper
    Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto.
    An improved exact algorithm for the domatic number problem.
    Inf. Process. Lett. 2007, Volume 101 (0) 2007
    Conference paper
    Jörg Rothe.
    Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages.
    SIGACT News 2007, Volume 38 (0) 2007
    Conference paper
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    A Richer Understanding of the Complexity of Election Systems
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto.
    An Improved Exact Algorithm for the Domatic Number Problem
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe.
    Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe.
    Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    André Große, Jörg Rothe, Gerd Wechsung.
    On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P.
    Inf. Process. Lett. 2006, Volume 99 (0) 2006
    Conference paper
    Edith Hemaspaandra, Jörg Rothe, Holger Spakowski.
    Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP.
    ITA 2006, Volume 40 (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe.
    Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey.
    J. UCS 2006, Volume 12 (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe.
    Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem.
    J. UCS 2006, Volume 12 (0) 2006
    Conference paper
    Jörg Rothe, Hiroki 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).
    J. UCS 2006, Volume 12 (0) 2006
    Conference paper
    Tobias Riege, Jörg Rothe.
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem.
    Theory Comput. Syst. 2006, Volume 39 (0) 2006
    Conference paper
    Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe.
    If P neq NP then some strongly noninvertible functions are invertible.
    Theor. Comput. Sci. 2006, Volume 362 (0) 2006
    Conference paper
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe.
    Anyone but Him: The Complexity of Precluding an Alternative.
    Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA 2005 (0) 2005
    Conference paper
    Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena.
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.
    Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Tobias Riege, Jörg Rothe.
    An Exact 2.9416
    Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena.
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory
    CoRR 2005, Volume 0 (0) 2005
    Show item 1 to 100 of 161  

    Your query returned 161 matches in the database.