Skip to main content
Sign in
Summit Research Repository
SIGN IN
SFU Mail
goSFU
Canvas
Library Catalogue
Search
Search
This site
SFU.ca
Submit your Research
Menu
Main navigation
Home
Collections
About
Contact
Search Summit
Bulatov, Andrei
Algorithms and Lower Bounds in Circuit Complexity
Approximation of source-oriented centrality in large networks and community detection
Community Detection in Networks using PageRank Contributions
Constraint Satisfaction Problems and friends: Symmetries and algorithm design
Counting homomorphisms in plain exponential time
Finding a satisfying assignment for planted NAE-E3-SAT using a voting style algorithm
Local approximation of page contributions in the PageRank algorithm
Local techniques in quadratic optimization and Satisfiability, and their applications
Mixed-integer linear programming robust regression with feature selection
Optimizing one-way car sharing systems
Pagination
1
2
››
Next page
Last »
Last page