Mihail N. Kolountzakis

According to our database, Mihail N. Kolountzakis authored at least 17 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2024

Exponential polynomials and identification of polygonal regions from Fourier samples.

Mihail N. Kolountzakis, Emmanuil Spyridakis

CoRR, 2024

2021

Deciding multiple tiling by polygons in polynomial time.

Mihail N. Kolountzakis

Period. Math. Hung., 2021

How many Fourier coefficients are needed?

Mihail N. Kolountzakis, Effie Papageorgiou

CoRR, 2021

2013

Structure Results for Multiple Tilings in 3D.

Nick Gravin, Mihail N. Kolountzakis, Sinai Robins, Dmitry Shiryaev

Discret. Comput. Geom., 2013

2011

Triangle Sparsifiers.

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

J. Graph Algorithms Appl., 2011

2010

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.

Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis

Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009

Approximate Triangle Counting

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

CoRR, 2009

On the Fourier spectrum of symmetric Boolean functions.

Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi

Comb., 2009

2004

Filling a Box with Translates of Two Bricks.

Mihail N. Kolountzakis

Electron. J. Comb., 2004

2003

Translational Tilings of the Integers with Long Periods.

Mihail N. Kolountzakis

Electron. J. Comb., 2003

2000

On the Structure of Multiple Translational Tilings by Polygonal Regions.

Mihail N. Kolountzakis

Discret. Comput. Geom., 2000

1998

Lattice Tilings by Cubes: Whole, Notched and Extended.

Mihail N. Kolountzakis

Electron. J. Comb., 1998

1996

Analysis of probabilistic roadmaps for path planning.

Lydia E. Kavraki, Mihail N. Kolountzakis, Jean-Claude Latombe

Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

1995

Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete.

Lydia E. Kavraki, Mihail N. Kolountzakis

Inf. Process. Lett., 1995

1994

Selection of a Large Sum-Free Subset in Polynomial Time.

Mihail N. Kolountzakis

Inf. Process. Lett., 1994

An Effective Additive Basis for the Integers.

Mihail N. Kolountzakis

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1992

Fast Computation of the Euclidian Distance Maps for Binary Images.

Mihail N. Kolountzakis, Kiriakos N. Kutulakos

Inf. Process. Lett., 1992