default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Aronov
Person information
- affiliation: New York University Tandon School of Engineering, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c99]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. SoCG 2024: 8:1-8:15- [c98]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². SoCG 2024: 9:1-9:15 - [c97]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fréchet Distance Oracles. SoCG 2024: 10:1-10:14 - [c96]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - [i35]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. CoRR abs/2403.02627 (2024) - [i34]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. CoRR abs/2403.04905 (2024) - [i33]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fr\'echet Distance Oracles. CoRR abs/2404.04065 (2024) - 2023
- [j101]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - [j100]Boris Aronov
, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - [j99]Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon:
Time and space efficient collinearity indexing. Comput. Geom. 110: 101963 (2023) - [i32]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - 2022
- [j98]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68(3): 647-663 (2022) - [j97]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68(3): 850-859 (2022) - [j96]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68(4): 997-1048 (2022) - [c95]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG 2022: 4:1-4:14 - [c94]Boris Aronov, Matthew J. Katz:
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. SWAT 2022: 11:1-11:14 - [i31]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR abs/2203.10241 (2022) - [i30]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning axis-parallel lines in 3D. CoRR abs/2204.01772 (2022) - 2021
- [j95]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On pseudo-disk hypergraphs. Comput. Geom. 92: 101687 (2021) - [j94]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SIAM J. Comput. 50(2): 760-787 (2021) - [j93]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17(3): 24:1-24:21 (2021) - [c93]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - [c92]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. SODA 2021: 1740-1756 - [i29]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021) - 2020
- [j92]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82(5): 1081-1100 (2020) - [j91]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64(3): 627-653 (2020) - [j90]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications. SIAM J. Comput. 49(6): 1109-1127 (2020) - [j89]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. SIAM J. Comput. 49(6): 1271-1290 (2020) - [c91]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. SoCG 2020: 7:1-7:15 - [c90]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG 2020: 8:1-8:14 - [c89]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. ISAAC 2020: 32:1-32:9 - [c88]Boris Aronov, Matthew J. Katz, Elad Sulami:
Dynamic Time Warping-Based Proximity Problems. MFCS 2020: 9:1-9:12 - [i28]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On beta-Plurality Points in Spatial Voting Games. CoRR abs/2003.07513 (2020) - [i27]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR abs/2003.09533 (2020) - [i26]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. CoRR abs/2003.11890 (2020) - [i25]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning. CoRR abs/2009.12369 (2020)
2010 – 2019
- 2019
- [j88]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. Electron. J. Comb. 26(1): 1 (2019) - [j87]Boris Aronov, Matthew J. Katz:
Guest Editors' Foreword. Discret. Comput. Geom. 61(4): 695-697 (2019) - [c87]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG 2019: 5:1-5:14 - [c86]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. SODA 2019: 2636-2648 - [c85]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. STACS 2019: 8:1-8:14 - [c84]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS 2019: 28-42 - [i24]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. CoRR abs/1904.09526 (2019) - [i23]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR abs/1904.11026 (2019) - 2018
- [j86]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80(11): 3316-3334 (2018) - [j85]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. 59(3): 725-741 (2018) - [j84]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14(4): 41:1-41:29 (2018) - [c83]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - [c82]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. ICALP 2018: 145:1-145:13 - [c81]Boris Aronov, Alon Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, Valentin Polishchuk, Boyang Wang, Hanyu Quan, Jiaxin Ding:
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World. MobiHoc 2018: 280-289 - [i22]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On Pseudo-disk Hypergraphs. CoRR abs/1802.08799 (2018) - [i21]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. CoRR abs/1804.10654 (2018) - [i20]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR abs/1805.02538 (2018) - [i19]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. CoRR abs/1812.10269 (2018) - 2017
- [j83]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. Discret. Comput. Geom. 57(1): 104-124 (2017) - [j82]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-space trade-offs for triangulating a simple polygon. J. Comput. Geom. 8(1): 105-124 (2017) - [c80]Boris Aronov, John Iacono, Khadijeh Sheikhan:
Nearest-Neighbor Search Under Uncertainty. CCCG 2017: 89-94 - [c79]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. SODA 2017: 2476-2494 - [e1]Boris Aronov, Matthew J. Katz:
33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. LIPIcs 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-038-5 [contents] - [i18]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. CoRR abs/1706.10193 (2017) - 2016
- [j81]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-sensitive planar point location. Comput. Geom. 54: 17-31 (2016) - [j80]Guillaume Moroz, Boris Aronov:
Computing the Distance between Piecewise-Linear Bivariate Functions. ACM Trans. Algorithms 12(1): 3:1-3:13 (2016) - [j79]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12(2): 26:1-26:28 (2016) - [j78]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms 13(1): 3:1-3:25 (2016) - [c78]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. SoCG 2016: 10:1-10:16 - [c77]Boris Aronov, Micha Sharir:
Almost tight bounds for eliminating depth cycles in three dimensions. STOC 2016: 1-8 - [c76]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. SWAT 2016: 30:1-30:12 - [i17]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. CoRR abs/1602.00767 (2016) - [i16]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. CoRR abs/1606.00112 (2016) - [i15]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR abs/1607.06136 (2016) - 2015
- [c75]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) 2015: 65-77 - [i14]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. CoRR abs/1502.01779 (2015) - [i13]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. CoRR abs/1504.07685 (2015) - [i12]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. CoRR abs/1509.07669 (2015) - [i11]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR abs/1512.00358 (2015) - 2014
- [j77]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. Graphs Comb. 30(4): 827-846 (2014) - [j76]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Mutual witness proximity graphs. Inf. Process. Lett. 114(10): 519-523 (2014) - [j75]Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir:
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [c74]Boris Aronov, Mark V. Yagnatinsky:
Quickly Placing a Point to Maximize Angles. CCCG 2014 - [i10]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. CoRR abs/1412.0962 (2014) - 2013
- [j74]Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20(2): 53 (2013) - [j73]Boris Aronov, Muriel Dulieu:
How to cover a point set with a V-shape of minimum width. Comput. Geom. 46(3): 298-309 (2013) - [j72]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Gabriel graphs. Comput. Geom. 46(7): 894-908 (2013) - [j71]Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Computing Correlation between Piecewise-Linear Functions. SIAM J. Comput. 42(5): 1867-1887 (2013) - [c73]Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky:
How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG 2013 - [c72]Boris Aronov, Mark V. Yagnatinsky:
How To Place a Point to Maximize Angles. CCCG 2013 - [c71]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest neighbor searching under uncertainty II. PODS 2013: 115-126 - [c70]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 - [c69]Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. WADS 2013: 49-60 - [i9]Boris Aronov, Mark V. Yagnatinsky:
How To Place a Point to Maximize Angles. CoRR abs/1310.6413 (2013) - 2012
- [j70]Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia:
Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160(10-11): 1441-1452 (2012) - [j69]Boris Aronov, Mark de Berg:
Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. 48(1): 53-64 (2012) - [c68]Guillaume Moroz, Boris Aronov:
Computing the distance between piecewise-linear bivariate functions. SODA 2012: 288-293 - 2011
- [j68]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) - [j67]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness (Delaunay) graphs. Comput. Geom. 44(6-7): 329-344 (2011) - [j66]Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote:
Lines Pinning Lines. Discret. Comput. Geom. 45(2): 230-260 (2011) - [j65]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [c67]Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi:
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. SCG 2011: 407-416 - [c66]Esther Ezra, Boris Aronov, Micha Sharir:
Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785 - [c65]Boris Aronov, Muriel Dulieu:
How to Cover a Point Set with a V-Shape of Minimum Width. WADS 2011: 61-72 - [c64]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. WADS 2011: 73-85 - [i8]Guillaume Moroz, Boris Aronov:
Computing the Distance between Piecewise-Linear Bivariate Functions. CoRR abs/1107.2312 (2011) - [i7]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. CoRR abs/1108.2058 (2011) - [i6]Boris Aronov, Muriel Dulieu:
How to Cover a Point Set with a V-Shape of Minimum Width. CoRR abs/1108.2063 (2011) - [i5]Boris Aronov, Dmitriy Drusvyatskiy:
Complexity of a Single Face in an Arrangement of s-Intersecting Curves. CoRR abs/1108.4336 (2011) - 2010
- [j64]Boris Aronov, Tetsuo Asano, Stefan Funke:
Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geom. Appl. 20(1): 89-104 (2010) - [j63]Boris Aronov, Micha Sharir:
Approximate Halfspace Range Counting. SIAM J. Comput. 39(7): 2704-2725 (2010) - [j62]Boris Aronov, Esther Ezra, Micha Sharir:
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010) - [c63]Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Computing similarity between piecewise-linear functions. SCG 2010: 375-383 - [i4]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Gabriel Graphs. CoRR abs/1008.1051 (2010) - [i3]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness (Delaunay) Graphs. CoRR abs/1008.1053 (2010)
2000 – 2009
- 2009
- [j61]Boris Aronov, Paz Carmi, Matthew J. Katz:
Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) - [j60]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky:
Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) - [c62]Boris Aronov, Esther Ezra, Micha Sharir:
Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 - [c61]Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 - 2008
- [j59]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j58]Boris Aronov, Mark de Berg, Chris Gray:
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008) - [j57]Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008) - [j56]