Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
—It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study i...
Lars Grammel, Melanie Tory, Margaret-Anne D. Store...
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
Link prediction is a fundamental problem in social network analysis and modern-day commercial applications such as Facebook and Myspace. Most existing research approaches this pro...