Keyphrases
2-approximation
16%
2-edge-connected
8%
Adversary
17%
Algorithm Efficiency
8%
Anonymity
9%
Anonymization
10%
Approximation Algorithms
100%
Approximation Guarantee
13%
Approximation Ratio
49%
Augmentation Problem
7%
Collaborative Filtering
8%
Combinatorial Auctions
11%
Computational Model
9%
Computer Science
44%
Computer Science Course
7%
Computer Science Curriculum
7%
Computer Science Education
8%
Computer Science Teacher Preparation
8%
Computer Science Teachers
8%
Connected Graph
9%
Connected Subgraphs
8%
Connection Problem
31%
Connectivity Augmentation
9%
Connectivity Augmentation Problem
17%
Convolutional Neural Network
7%
Covering Problem
9%
Degree Constrained
9%
Directed Graph
18%
Disjoint
12%
Distance Learning
7%
Distributed Algorithms
11%
Distributed Constraint Optimization Problem
7%
Distributed Symmetry Breaking
7%
Domain Specific Aspect Languages
8%
Domain-specific Languages
7%
Dominant Strategy
8%
Edge Coloring
10%
Edge Cover
10%
Edge Set
18%
Edge-connectivity
12%
Exponential Weights
7%
Face Recognition
11%
Family of Sets
8%
Fault-tolerant
7%
General Graphs
11%
Graph Connectivity
7%
Graph Problems
16%
Guard
7%
High School
10%
High School Computer Science
7%
High School Curriculum
7%
Improved Approximation
17%
Incentive Mechanism
11%
Israel
39%
Israeli
16%
Java
8%
K-anonymity
9%
K-connected
24%
K-connected Graph
10%
K-edge
11%
Language Workbench
7%
Log-log
10%
LP Relaxation
7%
Metric Space
18%
Minimum Cost
24%
Minimum number
8%
Minimum Power
21%
Minimum Size
8%
Modularity
7%
Monotone
8%
Multi-sided Markets
7%
Network Coding
15%
Network Design
7%
Network Design Problem
13%
Network Problems
10%
Neural Network
7%
Neuromorphic
19%
Node Connectivity
26%
Node Cost
7%
NP-hard
7%
NP-hard Problem
7%
Open University
23%
Orthogonal Polynomials
7%
Polynomial Time
7%
Polynomial-time Algorithm
8%
Privacy-preserving
22%
Recommender Systems
9%
Spiking Neural Networks
11%
Steiner Forest
8%
Steiner System
11%
Steiner Tree
7%
Submodular Maximization
9%
Survivable Network Design Problem
9%
Survivable Networks
15%
Tight
13%
Tree Augmentation
11%
Undirected Graph
23%
Vertex Coloring
7%
Wireless Networks
13%
Wireless Sensor Networks
7%
Computer Science
Access Structure
7%
Adversarial Jammer
5%
Annotation
6%
Anonymity
10%
Anonymization
14%
Approximate Solution
5%
Approximation (Algorithm)
63%
Approximation Algorithms
94%
Approximation Ratio
53%
Aspect-Oriented
7%
Aspect-Oriented Programming
5%
Collaborative Filtering
10%
Coloring Problem
6%
Communication Network
5%
Computational Modeling
11%
Computer Hardware
5%
Computer Science
42%
Computer Vision
6%
Connected Subgraph
21%
Connectivity Node
19%
Connectivity Problem
29%
Constant Factor
9%
Constraint Optimization Problems
7%
Convolutional Neural Network
5%
Data Mining
5%
Data Structure
17%
Deep Learning Method
7%
Degree Constraint
5%
Directed Graphs
39%
Distributed Algorithm
11%
Distributed Computing
7%
Domain-specific languages
9%
Efficient Algorithm
7%
Electronic Learning
9%
Face Recognition
12%
Fault Tolerant
9%
Feature Extraction
5%
Fundamental Problem
7%
Language Modeling
8%
Learning System
10%
Location Problem
5%
Machine Learning
10%
Maximal Independent Set
6%
Maximal Matching
7%
Mechanism Design
5%
Message Passing
8%
Metric Space
9%
Network Coding
17%
Network Design
10%
Network Design Problem
24%
Network Lifetime
5%
Network Traffic
5%
Neural Network
14%
Obfuscation
6%
Parsing
5%
Polynomial Time
17%
Primal-Dual
6%
Privacy Preservation
6%
Privacy Preserving
23%
Programming Language
7%
Recommender Systems
8%
Secondary Schools
13%
Secret Sharing
12%
secure multiparty computation
5%
Social Network
6%
steiner tree
6%
Subgraphs
45%
Syntactics
7%
Time Complexity
5%
Wireless Network
15%
Wireless Network Design
6%
Wireless Sensor Network
5%