Mihail N. Kolountzakis

According to our database1, Mihail N. Kolountzakis authored at least 16 papers between 1992 and 2021.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Deciding multiple tiling by polygons in polynomial time.
Period. Math. Hung., 2021

How many Fourier coefficients are needed?
CoRR, 2021

2013
Structure Results for Multiple Tilings in 3D.
Discret. Comput. Geom., 2013

2012
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.
Internet Math., 2012

2011
Triangle Sparsifiers.
J. Graph Algorithms Appl., 2011

2009
Approximate Triangle Counting
CoRR, 2009

On the Fourier spectrum of symmetric Boolean functions.
Comb., 2009

2004
Filling a Box with Translates of Two Bricks.
Electron. J. Comb., 2004

2003
Translational Tilings of the Integers with Long Periods.
Electron. J. Comb., 2003

2000
On the Structure of Multiple Translational Tilings by Polygonal Regions.
Discret. Comput. Geom., 2000

1998
Analysis of probabilistic roadmaps for path planning.
IEEE Trans. Robotics Autom., 1998

Lattice Tilings by Cubes: Whole, Notched and Extended.
Electron. J. Comb., 1998

1995
Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete.
Inf. Process. Lett., 1995

An effective additive basis for the integers.
Discret. Math., 1995

1994
Selection of a Large Sum-Free Subset in Polynomial Time.
Inf. Process. Lett., 1994

1992
Fast Computation of the Euclidian Distance Maps for Binary Images.
Inf. Process. Lett., 1992


  Loading...