BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Source URL: www.brics.dk

• Graph
• Matching
• Bipartite graph
• Independent set
• Matroid theory
• Tutte polynomial
• Path decomposition
• Graph theory
• Mathematics
• NP-complete problems

Specifications of the gamma-ray beam produced by the complete GBS (valid for the two gamma beams produced by GBS) Quantity Symbol

Source URL: www.eli-np.ro

CADporter ™ PDQ-NP True Interoperability for the CAD Industry The Elysium family of data exchange products provides complete solutions from the desktop to corporate services.

Source URL: elysiuminc.com

BRICS Basic Research in Computer Science BRICS RSKl´ıma & Srba: Matching Modulo Associativity and Idempotency is NP-Complete Matching Modulo Associativity and

Source URL: www.brics.dk

Representing Reductions of NP-Complete Problems in Logical Frameworks — A Case Study Jatin Shah Yale University

Source URL: www.itu.dk

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• NP-complete problems
• Boolean satisfiability problem
• NP-complete
• Satisfiability
• Maximum cut
• Algorithm
• Graph coloring
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Applied mathematics

Nature Precedings : doi:npre : Posted 3 AprMining the Largest Quasi-clique in Human Protein Interactome Paper ID: 211 Sanghamitra Bandyopadhyay

Source URL: precedings.nature.com

• NP-complete problems
• Bioinformatics
• Clique
• Interactome
• Nature Precedings
• Theoretical computer science
• Mathematics
• Applied mathematics

Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in

Source URL: drona.csa.iisc.ernet.in

• NP-complete problems
• Vertex cover
• Vertex
• Graph
• Hamiltonian path
• Tree
• Clique
• Neighbourhood
• Connectivity
• Graph theory
• Mathematics
• Theoretical computer science

CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms

Source URL: stanford.edu

• Operations research
• Computational complexity theory
• NP-complete problems
• Job shop scheduling
• Mathematical optimization
• Approximation algorithm
• Linear programming
• Algorithm
• Vertex cover
• Theoretical computer science
• Applied mathematics
• Mathematics

KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu

Source URL: algo2.iti.kit.edu

• Graph
• Graph coloring
• Planar separator theorem
• Path decomposition
• Graph theory
• NP-complete problems
• Graph partition