Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAnastasios Sidiropoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j20]Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar
:
Fractal Dimension and Lower Bounds for Geometric Problems. Discret. Comput. Geom. 66(1): 32-67 (2021)- [c56]Karine Chubarian, Abdul Rafae Khan, Anastasios Sidiropoulos, Jia Xu:
Grouping Words with Semantic Diversity. NAACL-HLT 2021: 3217-3228 - [i43]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Embeddings of Planar Quasimetrics into Directed 𝓁1 and Polylogarithmic Approximation for Directed Sparsest-Cut. CoRR abs/2111.07974 (2021) - 2020
- [j19]Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. J. Comb. Optim. 40(2): 512-546 (2020) - [c55]Karine Chubarian, Anastasios Sidiropoulos:
Computing Bi-Lipschitz Outlier Embeddings into the Line. APPROX-RANDOM 2020: 36:1-36:21 - [c54]Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh:
Learning Lines with Ordinal Constraints. APPROX-RANDOM 2020: 45:1-45:15 - [c53]Spyros Blanas, Paraschos Koutris, Anastasios Sidiropoulos:
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale. CIDR 2020 - [i42]Karine Chubarian, Anastasios Sidiropoulos:
Computing Bi-Lipschitz Outlier Embeddings into the Line. CoRR abs/2002.10039 (2020) - [i41]Diego Ihara Centurion, Bohan Fan, Francesco Sgherzi, Anastasios Sidiropoulos:
Learning Lines with Ordinal Constraints. CoRR abs/2004.13202 (2020) - [i40]Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos:
Maximizing coverage while ensuring fairness: a tale of conflicting objective. CoRR abs/2007.08069 (2020)
2010 – 2019
- 2019
- [j18]Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos:
Spectral concentration and greedy k-clustering. Comput. Geom. 76: 19-32 (2019) - [j17]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - [c52]Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos:
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. APPROX-RANDOM 2019: 14:1-14:15 - [c51]Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos:
Algorithms for Metric Learning via Contrastive Embeddings. SoCG 2019: 45:1-45:14 - [c50]Igor Fortel, Mitchell Butler, Laura E. Korthauer, Liang Zhan, Olusola Ajilore, Ira Driscoll, Anastasios Sidiropoulos, Yanfu Zhang, Lei Guo, Heng Huang, Dan Schonfeld, Alex D. Leow:
Brain Dynamics Through the Lens of Statistical Mechanics by Unifying Structure and Function. MICCAI (5) 2019: 503-511 - [c49]Brian Axelrod, Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, Gregory Valiant:
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. NeurIPS 2019: 7721-7733 - [c48]Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar:
On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs. SODA 2019: 535-553 - [c47]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic approximation for Euler genus on bounded degree graphs. STOC 2019: 164-175 - [i39]Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos:
Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms. CoRR abs/1905.09989 (2019) - [i38]Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart, Gregory Valiant:
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. CoRR abs/1907.08306 (2019) - 2018
- [j16]Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar:
Quasimetric Embeddings and Their Applications. Algorithmica 80(12): 3803-3824 (2018) - [j15]Feilong Liu, Ario Salmasi, Spyros Blanas, Anastasios Sidiropoulos:
Chasing Similarity: Distribution-aware Aggregation Scheduling. Proc. VLDB Endow. 12(3): 292-306 (2018) - [j14]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. SIAM J. Comput. 47(4): 1610-1643 (2018) - [j13]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ACM Trans. Algorithms 14(2): 24:1-24:20 (2018) - [c46]Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. COLT 2018: 1234-1262 - [c45]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG 2018: 21:1-21:14 - [c44]Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar:
Fractal Dimension and Lower Bounds for Geometric Problems. SoCG 2018: 70:1-70:14 - [i37]Facundo Mémoli, Anastasios Sidiropoulos, Kritika Singhal:
Sketching and Clustering Metric Measure Spaces. CoRR abs/1801.00551 (2018) - [i36]Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR abs/1802.10575 (2018) - [i35]Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes? CoRR abs/1804.10577 (2018) - [i34]Diego Ihara Centurion, Neshat Mohammadi, Anastasios Sidiropoulos:
Algorithms for metric learning via contrastive embeddings. CoRR abs/1807.04881 (2018) - [i33]Feilong Liu, Ario Salmasi, Spyros Blanas, Anastasios Sidiropoulos:
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version). CoRR abs/1810.00511 (2018) - [i32]Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR abs/1812.05524 (2018) - 2017
- [j12]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-Approximation for the Genus of Hamiltonian Graphs. Theory Comput. 13(1): 1-47 (2017) - [c43]Anastasios Sidiropoulos, Vijay Sridhar:
Algorithmic Interpretations of Fractal Dimension. SoCG 2017: 58:1-58:16 - [c42]Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Clustering. ESA 2017: 34:1-34:14 - [c41]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic Approximation for Minimum Planarization (Almost). FOCS 2017: 779-788 - [c40]Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Hierarchical Clustering. ISAAC 2017: 28:1-28:12 - [c39]Anastasios Sidiropoulos, Dingkang Wang, Yusu Wang:
Metric embeddings with outliers. SODA 2017: 670-689 - [i31]Anastasios Sidiropoulos, Vijay Sridhar:
Algorithmic interpretations of fractal dimension. CoRR abs/1703.09324 (2017) - [i30]Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Clustering. CoRR abs/1704.05964 (2017) - [i29]Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Hierarchical Clustering. CoRR abs/1707.09904 (2017) - [i28]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic approximation for minimum planarization (almost). CoRR abs/1708.04723 (2017) - [i27]Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar:
On constant multi-commodity flow-cut gaps for directed minor-free graphs. CoRR abs/1711.01370 (2017) - [i26]Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos:
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. CoRR abs/1711.01692 (2017) - [i25]Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar:
Fractal dimension and lower bounds for geometric problems. CoRR abs/1712.04595 (2017) - [i24]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR abs/1712.06747 (2017) - 2016
- [j11]Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
Layouts of Expander Graphs. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j10]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55(1): 39-73 (2016) - [c38]Arturs Backurs, Anastasios Sidiropoulos:
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces. APPROX-RANDOM 2016: 1:1-1:15 - [c37]Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos:
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. APPROX-RANDOM 2016: 16:1-16:54 - [c36]Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar:
Quasimetric Embeddings and Their Applications. ICALP 2016: 85:1-85:14 - [c35]Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos:
Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. SPAA 2016: 161-163 - [i23]Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos:
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. CoRR abs/1601.01372 (2016) - [i22]Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar:
Quasimetric embeddings and their applications. CoRR abs/1608.01396 (2016) - [i21]Dániel Marx, Anastasios Sidiropoulos:
The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems. CoRR abs/1612.01171 (2016) - 2015
- [c34]Amir Nayyeri, Anastasios Sidiropoulos:
Computing the Fréchet Distance Between Polygons with Holes. ICALP (1) 2015: 997-1009 - [c33]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ISAAC 2015: 529-540 - [c32]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Beyond the Euler Characteristic: Approximating the Genus of General Graphs. STOC 2015: 675-682 - [i20]Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
3-Monotone Expanders. CoRR abs/1501.05020 (2015) - [i19]David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos:
Approximate Greedy Clustering and Distance Selection for Graph Metrics. CoRR abs/1507.01555 (2015) - [i18]Anastasios Sidiropoulos, Yusu Wang:
Metric embedding with outliers. CoRR abs/1508.03600 (2015) - [i17]Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. CoRR abs/1509.05751 (2015) - 2014
- [c31]Dániel Marx, Anastasios Sidiropoulos:
The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems. SoCG 2014: 67 - [c30]Jeff Erickson, Anastasios Sidiropoulos:
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. SoCG 2014: 130 - [c29]Anupam Gupta, Anastasios Sidiropoulos:
Minimum d-dimensional arrangement with fixed points. SODA 2014: 1727-1738 - [i16]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR abs/1401.7042 (2014) - [i15]Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Spectral concentration, robust k-center, and simple clustering. CoRR abs/1404.1008 (2014) - [i14]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Beyond the Euler characteristic: Approximating the genus of general graphs. CoRR abs/1412.1792 (2014) - 2013
- [j9]James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. Comb. 33(3): 349-374 (2013) - [j8]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. J. Comput. Geom. 4(1): 212-239 (2013) - [c28]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-approximation for the Genus of Hamiltonian Graphs. APPROX-RANDOM 2013: 244-259 - [c27]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. FOCS 2013: 167-176 - [c26]Anastasios Sidiropoulos:
Non-positive Curvature and the Planar Embedding Conjecture. FOCS 2013: 177-186 - [c25]Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos:
Euclidean spanners in high dimensions. SODA 2013: 804-809 - [i13]Jeff Erickson, Anastasios Sidiropoulos:
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. CoRR abs/1304.1810 (2013) - [i12]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation algorithms for Euler genus and related problems. CoRR abs/1304.2416 (2013) - [i11]Anastasios Sidiropoulos:
Non-positive curvature, and the planar embedding conjecture. CoRR abs/1304.7512 (2013) - [i10]Anupam Gupta, Anastasios Sidiropoulos:
Minimum d-dimensional arrangement with fixed points. CoRR abs/1307.6627 (2013) - 2012
- [j7]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and approximation in potential games. Theor. Comput. Sci. 438: 13-27 (2012) - [c24]Yury Makarychev, Anastasios Sidiropoulos:
Planarizing an Unknown Surface. APPROX-RANDOM 2012: 266-275 - [c23]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to walk your dog in the mountains with no magic leash. SCG 2012: 121-130 - [i9]Yury Makarychev, Anastasios Sidiropoulos:
Planarizing an Unknown Surface. CoRR abs/1206.4898 (2012) - 2011
- [j6]Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
How strong is Nisanʼs pseudo-random generator? Inf. Process. Lett. 111(16): 804-808 (2011) - [c22]Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Computationally Limited Randomness. ICS 2011: 522-536 - [c21]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. SODA 2011: 1050-1069 - [c20]James R. Lee, Anastasios Sidiropoulos:
Near-optimal distortion bounds for embedding doubling spaces into L1. STOC 2011: 765-772 - 2010
- [j5]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010) - [j4]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4): 66:1-66:19 (2010) - [j3]Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos:
Undecidability and intractability results concerning datalog programs and their persistency numbers. ACM Trans. Comput. Log. 11(2): 12:1-12:29 (2010) - [c19]Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias:
Online Embeddings. APPROX-RANDOM 2010: 246-259 - [c18]Anastasios Sidiropoulos:
Optimal Stochastic Planarization. FOCS 2010: 163-170 - [c17]James R. Lee, Anastasios Sidiropoulos:
Genus and the Geometry of the Cut Graph. SODA 2010: 193-201 - [c16]Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias:
Inapproximability for Planar Embedding Problems. SODA 2010: 222-235 - [i8]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. CoRR abs/1003.1426 (2010) - [i7]Anastasios Sidiropoulos:
Optimal stochastic planarization. CoRR abs/1004.1666 (2010) - [i6]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. CoRR abs/1009.1866 (2010) - [i5]Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos:
On Graph Crossing Number and Edge Planarization. CoRR abs/1010.3976 (2010)
2000 – 2009
- 2009
- [c15]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. SCG 2009: 371-376 - [c14]James R. Lee, Anastasios Sidiropoulos:
On the geometry of graphs with a forbidden minor. STOC 2009: 245-254 - [c13]Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler:
Streaming Embeddings with Slack. WADS 2009: 483-494 - [i4]James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. CoRR abs/0910.1409 (2009) - [i3]Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Polynomial Time with Restricted Use of Randomness. Electron. Colloquium Comput. Complex. 16: 39 (2009) - 2008
- [b1]Anastasios Sidiropoulos:
Computational metric embeddings. Massachusetts Institute of Technology, Cambridge, MA, USA, 2008 - [j2]Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos:
Theory research at Google. SIGACT News 39(2): 10-28 (2008) - [j1]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms 4(4): 46:1-46:21 (2008) - [c12]Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam:
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34 - [c11]Krzysztof Onak, Anastasios Sidiropoulos:
Circular partitions with applications to visualization and embeddings. SCG 2008: 28-37 - [c10]Jirí Matousek, Anastasios Sidiropoulos:
Inapproximability for Metric Embeddings into R^d. FOCS 2008: 405-413 - [c9]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. SODA 2008: 710-719 - [i2]Jirí Matousek, Anastasios Sidiropoulos:
Inapproximability for metric embeddings into R^d. CoRR abs/0807.2472 (2008) - 2007
- [c8]Piotr Indyk, Anastasios Sidiropoulos:
Probabilistic embeddings of bounded genus graphs into planar graphs. SCG 2007: 204-209 - [c7]Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos:
Approximation algorithms for embedding general metrics into trees. SODA 2007: 512-521 - 2006
- [c6]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Embedding ultrametrics into low-dimensional spaces. SCG 2006: 187-196 - [c5]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and Approximation in Potential Games. STACS 2006: 349-360 - [i1]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006) - 2005
- [c4]Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos:
Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128 - [c3]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA 2005: 650-659 - [c2]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233 - 2003
- [c1]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos:
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-11-18 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
