Sotabase

Career

· Deputy Chair, EDEN NAP Steering Committee, EDEN Digital Learning Europe2023–
· Researcher, EDEN Digital Learning Europe2023–
· Researcher, Vytauto Didžiojo universitetas2017–
· Researcher, Mentor, Promote project2015–2016
· Researcher, Vytautas Magnus University2013–
· Doctor of Philosophy (Ph.D.), Vytauto Didžiojo universitetas2013–2019
· Teaching Assistant, Vytauto Didžiojo universitetas (Current)2013–
· Researcher, Erasmus Academic Network CiCe2011–2013
· Master’s Degree, Vytauto Didžiojo universitetas2009–2011
· Exchange studies, The Manchester Metropolitan University2006–2007
· Bachelor’s Degree, Šiauliu Universitetas2004–2008

Publications (35)

Detecting High Log-Densities – an O ( n 1 / 4 ) Approximation for Densest k -Subgraph
2010
359
cited
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science · 2004
138
cited
Convex Relaxations and Integrality Gaps
2012
104
cited
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
IEEE Annual Symposium on Foundations of Computer Science · 2007
94
cited
New approximation guarantee for chromatic number
Symposium on the Theory of Computing · 2006
94
cited
How to Play Unique Games Using Embeddings
IEEE Annual Symposium on Foundations of Computer Science · 2006
70
cited
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2008
67
cited
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
ACM-SIAM Symposium on Discrete Algorithms · 2016
63
cited
The Densest k-Subhypergraph Problem
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2016
57
cited
Efficient traversal of mesh edges using adjacency primitives
ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia · 2008
54
cited
Everywhere-Sparse Spanners via Dense Subgraphs
IEEE Annual Symposium on Foundations of Computer Science · 2012
49
cited
Inapproximability of NP-Complete Variants of Nash Equilibrium
Theory of Computing · 2011
41
cited
Approximating Fair Clustering with Cascaded Norm Objectives
ACM-SIAM Symposium on Discrete Algorithms · 2021
32
cited
Approximating Spanners and Directed Steiner Forest
ACM-SIAM Symposium on Discrete Algorithms · 2016
32
cited
Linear Index Coding via Semidefinite Programming†
Combinatorics, probability & computing · 2011
29
cited
Approximating Sparsest Cut in Graphs of Bounded Treewidth
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2010
23
cited
Approximation Algorithms for Label Cover and The Log-Density Threshold
ACM-SIAM Symposium on Discrete Algorithms · 2017
22
cited
Lower Bounds
Algorithms · 2021
21
cited
Lowest Degree k-Spanner: Approximation and Hardness
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2014
15
cited
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2018
14
cited
Sotabase
Eden Chlamtac | Researcher Profile | Sotabase | Sotabase