Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Fingerprint Dive into the research topics where Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is active. These topic labels come from the works of this organization's members. Together they form a unique fingerprint.

Mathematics

Competition Graph
Graph in graph theory
Privacy Preserving
Competition number
Colouring
Vertex of a graph
Privacy
Acyclic Digraph
Digraph
Food Web
Signed Graph
Uniqueness
Axioms
Publish/subscribe
Decision Making
Decision tree
Phylogeny
Social Networks
Cycle
Model
Arc of a curve
Computer Science
Boxicity
Merging
Integer
Query
Triangle
Ecology
Even number
Penalty
Inspection
Optimality
Conjoint Measurement
Covering
Server
Location Theory
Scheduling
Social Sciences
Semiorder
Identifying Code
Median Graph
Preference Modelling
Earliness-tardiness
Connected graph
Secure Computation
Model Selection
Multiparty Computation
Subjective Probability
Mobile Sensor Networks
Ramsey Theory
Indefinite Systems
Quorum
Finite Graph
Binary search
Earliness
Integer Sequences
Compliance
Generalization Error
Indicator function
Fibonacci sequence
Sustainability
Threshold Model
Fisheries
Key Exchange
Quadratic Program
Security Protocols
User Model
Sensor
If and only if
Survival Probability
Functional equation
Clique
Interior Point Method
Anomaly Detection
Interval Graphs
Combinatorial Optimization
Axiomatization
Discrepancy
Experimental Analysis
Classifier
Formal Model
Binary
Computing
Game Theory
Distributed Computing
Decision Support
Open Problems
Voting
Container
Assignment
Trapping
Graph theory
Encryption
Group Testing
Probabilistic Model
Complex Networks
Alternatives
Surveillance
Theoretical Model
Arbitrary
Packing
Biology
Crossover
Distinct
Elimination
Automorphisms
Anomalous
Finite Set
Measurement Theory
Graph Coloring
Artificial Intelligence
Attribute
Bioinformatics
Game
Pareto Optimality
Scaling
Two Dimensions
Channel Assignment Problem
Complement
Nonseparable
Schedule
Data Mining
Anonymity
Analogue
Clustering
Dynamic Games
Approximation
Structural Modeling
Homomorphisms
Combinatorics
Grid Graph
Undirected Graph
Cross-validation
Social Structure
Vessel
Utility Maximization
Path
Attack
Representability
Theorem
Modeling
Secure multi-party Computation
Maximum Degree
Damage
Scenarios
Regular Sequence
Random walk
Symmetric Cryptography
Intersection
Minimum Spanning Tree
Subgraph

Engineering & Materials Science

Coloring
Decision trees
Computer science
Social sciences
Decision making
Inspection
Telecommunication networks
Communication
Hypertext systems
Students
Scheduling
Coastal zones
Classifiers
Stadiums
Data mining
Combinatorial optimization
Network protocols
Measurement theory
Distributed computer systems
Color
Sensors
Servers
Security of data
Game theory
Multilayers
Statistics
Cryptography
Experiments
Containers
Clustering algorithms
Metal detectors
Hypermedia systems
Learning algorithms
National security
Ecology
Testing
Sampling
Data privacy
Uncertainty analysis
Fisheries
Mobile computing
Statistical tests
Carrier mobility
Screening
Design of experiments
Reinforcement learning
Boats
Global optimization
Bioinformatics
Costs
Routing algorithms
Network performance
Invariance
Sports
Charge carriers
Merging
Mobile devices
Linear programming
Web services
Aviation
Topology
Sensor networks
Artificial intelligence
Wireless networks
Taxicabs
Information systems
Molecular biology
Probability distributions
Network layers
Education
Fishing vessels
Health
Cellular telephones
Slotting
Economics
Proteins
Information retrieval
Electron-electron interactions
Natural sciences computing
Planning
Epidemiology
Taxonomies
Operations research
Electrodes
Urban planning
Computer systems
Aircraft
Networks (circuits)
Amino acids
Monitoring
Data integration
Trees (mathematics)
Customer satisfaction
Detectors
Numerical methods
Free volume
Statistical methods