default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlantha Newman
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Felix Klingelhöfer, Alantha Newman:
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods. Comb. 44(4): 881-895 (2024)- [j14]Felix Klingelhöfer, Alantha Newman:
Coloring Tournaments with Few Colors: Algorithms and Complexity. SIAM J. Discret. Math. 38(4): 3111-3133 (2024) - [c24]Anand Louis, Alantha Newman, Arka Ray:
Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding. FSTTCS 2024: 30:1-30:19 - [c23]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee
, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. SODA 2024: 935-961 - [c22]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster Linear Program for Correlation Clustering. STOC 2024: 1605-1616 - [i20]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster LP for Correlation Clustering. CoRR abs/2404.17509 (2024) - [i19]Anand Louis, Alantha Newman, Arka Ray:
Improved linearly ordered colorings of hypergraphs via SDP rounding. CoRR abs/2405.00427 (2024) - 2023
- [j13]Camille Gras, Nathalie Herr, Alantha Newman:
A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure. Int. J. Prod. Res. 61(21): 7198-7212 (2023) - [j12]Arash Haddadan, Alantha Newman:
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. Math. Program. 198(1): 595-620 (2023) - [c21]Felix Klingelhöfer, Alantha Newman:
Coloring Tournaments with Few Colors: Algorithms and Complexity. ESA 2023: 71:1-71:14 - [c20]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. FOCS 2023: 1082-1104 - [c19]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. SOSA 2023: 124-136 - [i18]Felix Klingelhöfer, Alantha Newman:
Coloring tournaments with few colors: Algorithms and complexity. CoRR abs/2305.02922 (2023) - [i17]Felix Klingelhöfer, Alantha Newman:
Bounding the chromatic number of dense digraphs by arc neighborhoods. CoRR abs/2307.04446 (2023) - [i16]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. CoRR abs/2309.17243 (2023) - [i15]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR abs/2311.00892 (2023) - 2022
- [c18]Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman:
Correlation Clustering with Sherali-Adams. FOCS 2022: 651-661 - [i14]Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman:
Correlation Clustering with Sherali-Adams. CoRR abs/2207.10889 (2022) - 2021
- [j11]Arash Haddadan, Alantha Newman:
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. Discret. Optim. 42: 100659 (2021) - [j10]Arash Haddadan, Alantha Newman, R. Ravi:
Shorter tours and longer detours: uniform covers and a bit beyond. Math. Program. 185(1-2): 245-273 (2021) - [c17]Camille Gras, Van-Dat Cung, Nathalie Herr, Alantha Newman:
A Hierarchical Network Approach for Long-Haul Parcel Transportation. APMS (5) 2021: 168-178 - [i13]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. CoRR abs/2110.11851 (2021) - 2020
- [j9]Alantha Newman:
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. SIAM J. Discret. Math. 34(1): 865-884 (2020)
2010 – 2019
- 2019
- [j8]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring Dense Digraphs. Comb. 39(5): 1021-1053 (2019) - [c16]Arash Haddadan, Alantha Newman:
Towards Improving Christofides Algorithm for Half-Integer TSP. ESA 2019: 56:1-56:12 - [i12]Arash Haddadan, Alantha Newman:
Towards improving Christofides algorithm for half-integer TSP. CoRR abs/1907.02120 (2019) - 2018
- [j7]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j6]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms 14(2): 19:1-19:23 (2018) - [c15]Alantha Newman:
Complex Semidefinite Programming and Max-k-Cut. SOSA 2018: 13:1-13:11 - [i11]Adrien Argento, Alantha Newman:
Explicit 3-colorings for exponential graphs. CoRR abs/1808.08691 (2018) - [i10]Arash Haddadan, Alantha Newman:
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring. CoRR abs/1811.09906 (2018) - [i9]Kevin L. Chang, Alantha Newman:
Rounding semidefinite programs for large-domain problems via Brownian motion. CoRR abs/1812.03572 (2018) - [i8]Alantha Newman:
Complex Semidefinite Programming and Max-k-Cut. CoRR abs/1812.10770 (2018) - 2017
- [j5]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring dense digraphs. Electron. Notes Discret. Math. 61: 577-583 (2017) - [i7]Arash Haddadan, Alantha Newman, R. Ravi:
Cover and Conquer: Augmenting Decompositions for Connectivity Problems. CoRR abs/1707.05387 (2017) - 2016
- [c14]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. ESA 2016: 71:1-71:16 - [r2]Alantha Newman:
Max Cut. Encyclopedia of Algorithms 2016: 1206-1210 - 2015
- [j4]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson:
On the configuration LP for maximum budgeted allocation. Math. Program. 154(1-2): 427-462 (2015) - [i6]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. CoRR abs/1511.09259 (2015) - 2014
- [c13]Alantha Newman:
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. ESA 2014: 737-749 - [c12]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. IPCO 2014: 333-344 - [c11]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. WG 2014: 312-323 - [i5]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. CoRR abs/1403.7519 (2014) - [i4]Alantha Newman:
An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs. CoRR abs/1407.2524 (2014) - [i3]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. CoRR abs/1407.2844 (2014) - 2012
- [c10]Alantha Newman, Ofer Neiman, Aleksandar Nikolov:
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS 2012: 253-262 - 2011
- [c9]Konstantin Makarychev, Alantha Newman:
Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459 - [c8]Moses Charikar, Alantha Newman, Aleksandar Nikolov:
Tight Hardness Results for Minimizing Discrepancy. SODA 2011: 1607-1614 - [i2]Alantha Newman, Aleksandar Nikolov:
A counterexample to Beck's conjecture on the discrepancy of three permutations. CoRR abs/1104.2922 (2011) - 2010
- [i1]Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)
2000 – 2009
- 2008
- [j3]Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5): 23:1-23:27 (2008) - [j2]Fumei Lam, Alantha Newman:
Traveling salesman path problems. Math. Program. 113(1): 39-59 (2008) - [r1]Alantha Newman:
Max Cut. Encyclopedia of Algorithms 2008 - 2007
- [j1]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007) - 2005
- [c7]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684 - [c6]Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: ranking and clustering. STOC 2005: 684-693 - 2004
- [b1]Alantha Newman:
Algorithms for string and graph layout. Massachusetts Institute of Technology, Cambridge, MA, USA, 2004 - [c5]Alantha Newman:
Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. APPROX-RANDOM 2004: 195-206 - [c4]Alantha Newman, Matthias Ruhl:
Combinatorial Problems on Strings with Applications to Protein Folding. LATIN 2004: 369-378 - 2002
- [c3]Alantha Newman:
A new algorithm for protein folding in the HP model. SODA 2002: 876-884 - 2001
- [c2]Alantha Newman, Santosh S. Vempala:
Fences Are Futile: On Relaxations for the Linear Ordering Problem. IPCO 2001: 333-347 - [c1]Alantha Newman:
The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. RANDOM-APPROX 2001: 147-158
Coauthor Index
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2025-01-06 21:44 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 was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
