Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company, and our products.
  1. current community

    • Theoretical Computer Science
      help chat
    • Theoretical Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Theoretical Computer Science
    1. Home
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
  1. Teams
    Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
  2. Teams
  3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more about Teams
Mathieu Chapelle's user avatar
Mathieu Chapelle's user avatar
Mathieu Chapelle's user avatar
Mathieu Chapelle
  • Member for 12 years, 11 months
  • Last seen more than 11 years ago
  • univ-orleans.fr/lifo/Members/…
  • Orléans, France
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bounties
  • Reputation
  • All actions

6 Answers

Score Activity Newest
16 votes
Accepted

Is clique-width preserved under edge contractions?

  • graph-theory
  • co.combinatorics
  • cliquewidth
answered Dec 22, 2010 at 16:54
16 votes

The origin of the notion of treewidth

  • graph-theory
  • co.combinatorics
  • big-picture
  • ho.history-overview
  • treewidth
answered Feb 19, 2011 at 15:55
10 votes
Accepted

What is the parameterized complexity of following model checking problem?

  • cc.complexity-theory
  • descriptive-complexity
  • parameterized-complexity
  • finite-model-theory
  • model-checking
answered Jan 12, 2011 at 12:03
8 votes

Hardness of finding a graph coloring given the optimal number of colors

  • cc.complexity-theory
  • reference-request
  • graph-colouring
answered Jan 19, 2011 at 18:05
6 votes

Instance of FPT-reductions that is not a polynomial-time reduction

  • cc.complexity-theory
  • np-hardness
  • reductions
  • parameterized-complexity
answered Jan 7, 2011 at 19:17
4 votes

A decomposition theorem for maximum weight matchings

  • graph-theory
  • co.combinatorics
  • matching
answered Jan 11, 2011 at 13:48
Theoretical Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2023.11.30.1842

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.