default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElias Koutsoupias
Person information
- affiliation: University of Oxford, UK
- award (2012): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i26]Aggelos Kiayias, Elias Koutsoupias, Francisco J. Marmolejo Cossío, Aikaterini-Panagiota Stouka:
Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. CoRR abs/2407.08686 (2024)- [i25]Aggelos Kiayias, Elias Koutsoupias, Philip Lazos, Giorgos Panagiotakos:
Blockchain Space Tokenization. IACR Cryptol. ePrint Arch. 2024: 1154 (2024) - 2023
- [c66]George Christodoulou
, Amos Fiat, Elias Koutsoupias, Alkmini Sgouritsa:
Fair allocation in graphs. EC 2023: 473-488 - [c65]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A Proof of the Nisan-Ronen Conjecture. STOC 2023: 672-685 - [i24]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A proof of the Nisan-Ronen conjecture. CoRR abs/2301.11905 (2023) - [i23]Aggelos Kiayias, Elias Koutsoupias, Philip Lazos, Giorgos Panagiotakos:
Tiered Mechanisms for Blockchain Transaction Fees. CoRR abs/2304.06014 (2023) - 2022
- [j36]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the nisan-ronen conjecture. SIGecom Exch. 20(1): 41-46 (2022) - [c64]Elias Koutsoupias:
Algorithmic Game Theory and Blockchains (Invited Talk). Tokenomics 2022: 1:1-1:2 - 2021
- [j35]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. ACM Trans. Algorithms 17(3): 20:1-20:23 (2021) - [c63]Aggelos Kiayias, Elias Koutsoupias, Aikaterini-Panagiota Stouka:
Incentives Against Power Grabs or How to Engineer the Revolution in a Pooled Proof of Stake System. DAPPS 2021: 1-10 - [c62]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. FOCS 2021: 839-850 - [c61]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful Allocation in Graphs and Hypergraphs. ICALP 2021: 56:1-56:20 - [c60]Christian Coester, Elias Koutsoupias:
Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. ICALP 2021: 57:1-57:20 - [i22]Christian Coester, Elias Koutsoupias:
Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle. CoRR abs/2102.10474 (2021) - [i21]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful allocation in graphs and hypergraphs. CoRR abs/2106.03724 (2021) - [i20]Aggelos Kiayias, Elias Koutsoupias, Aikaterini-Panagiota Stouka:
Incentives Against Power Grabs or How to Engineer the Revolution in a Pooled Proof of Stake System. CoRR abs/2111.08562 (2021) - 2020
- [j34]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Prior-free multi-unit auctions with ordered bidders. Theor. Comput. Sci. 846: 160-171 (2020) - [c59]Lars Brünjes, Aggelos Kiayias, Elias Koutsoupias, Aikaterini-Panagiota Stouka:
Reward Sharing Schemes for Stake Pools. EuroS&P 2020: 256-275 - [c58]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío:
Fairness and Efficiency in DAG-Based Cryptocurrencies. Financial Cryptography 2020: 79-96 - [c57]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. STOC 2020: 1086-1096 - [p1]Anna R. Karlin, Elias Koutsoupias:
Beyond Competitive Analysis. Beyond the Worst-Case Analysis of Algorithms 2020: 529-546 - [i19]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. CoRR abs/2011.14434 (2020)
2010 – 2019
- 2019
- [j33]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). Games Econ. Behav. 113: 38-57 (2019) - [j32]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The anarchy of scheduling without money. Theor. Comput. Sci. 778: 19-32 (2019) - [c56]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Christos H. Papadimitriou:
Energy Equilibria in Proof-of-Work Mining. EC 2019: 489-502 - [c55]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - [c54]Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras:
Wealth Inequality and the Price of Anarchy. STACS 2019: 31:1-31:16 - [c53]Christian Coester, Elias Koutsoupias:
The online k-taxi problem. STOC 2019: 1136-1147 - [c52]Elias Koutsoupias, Philip Lazos, Foluso Ogunlana, Paolo Serafino:
Blockchain Mining Games with Pay Forward. WWW 2019: 917-927 - [i18]Elias Koutsoupias, Philip Lazos, Paolo Serafino, Foluso Ogunlana:
Blockchain Mining Games with Pay Forward. CoRR abs/1905.07397 (2019) - [i17]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. CoRR abs/1907.12733 (2019) - [i16]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío:
Fairness and Efficiency in DAG-based Cryptocurrencies. CoRR abs/1910.02059 (2019) - 2018
- [j31]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling two goods optimally. Inf. Comput. 261: 432-445 (2018) - [j30]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and Optimality of Auctions for Uniform Distributions. SIAM J. Comput. 47(1): 121-165 (2018) - [c51]Elias Koutsoupias, Philip Lazos:
Online Trading as a Secretary Problem. SAGT 2018: 201-212 - [i15]Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras:
Wealth Inequality and the Price of Anarchy. CoRR abs/1802.09269 (2018) - [i14]Christian Coester, Elias Koutsoupias:
The Online k-Taxi Problem. CoRR abs/1807.06645 (2018) - [i13]Lars Brünjes, Aggelos Kiayias, Elias Koutsoupias, Aikaterini-Panagiota Stouka:
Reward Sharing Schemes for Stake Pools. CoRR abs/1807.11218 (2018) - [i12]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. CoRR abs/1811.09233 (2018) - [i11]Elias Koutsoupias, Philip Lazos:
Online Trading as a Secretary Problem. CoRR abs/1812.11149 (2018) - 2017
- [c50]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. ICALP 2017: 14:1-14:14 - [c49]Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos:
Online Market Intermediation. ICALP 2017: 47:1-47:14 - [i10]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. CoRR abs/1702.08474 (2017) - [i9]Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos:
Online Market Intermediation. CoRR abs/1703.09279 (2017) - 2016
- [c48]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach:
Carpooling in Social Networks. ICALP 2016: 43:1-43:13 - [c47]Matthias Gerstgrasser, Paul W. Goldberg, Elias Koutsoupias:
Revenue Maximization for Market Intermediation with Correlated Priors. SAGT 2016: 273-285 - [c46]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. SAGT 2016: 302-314 - [c45]Amos Fiat, Kira Goldner, Anna R. Karlin, Elias Koutsoupias:
The FedEx Problem. EC 2016: 21-22 - [c44]Aggelos Kiayias, Elias Koutsoupias, Maria Kyropoulou, Yiannis Tselekounis:
Blockchain Mining Games. EC 2016: 365-382 - [i8]Aggelos Kiayias, Elias Koutsoupias, Maria Kyropoulou, Yiannis Tselekounis:
Blockchain Mining Games. CoRR abs/1607.02420 (2016) - [i7]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. CoRR abs/1607.03688 (2016) - 2015
- [j29]Yiannis Giannakopoulos, Elias Koutsoupias:
Competitive analysis of maintaining frequent items of a stream. Theor. Comput. Sci. 562: 23-32 (2015) - [c43]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling Two Goods Optimally. ICALP (2) 2015: 650-662 - [i6]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling Two Goods Optimally. CoRR abs/1510.03399 (2015) - 2014
- [j28]Elias Koutsoupias:
Scheduling Without Payments. Theory Comput. Syst. 54(3): 375-387 (2014) - [c42]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and optimality of auctions for uniform distributions. EC 2014: 259-276 - [e4]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Lecture Notes in Computer Science 8572, Springer 2014, ISBN 978-3-662-43947-0 [contents] - [e3]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8573, Springer 2014, ISBN 978-3-662-43950-0 [contents] - [i5]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and Optimality of Auctions for Uniform Distributions. CoRR abs/1404.2329 (2014) - 2013
- [j27]Elias Koutsoupias, Angelina Vidali:
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica 66(1): 211-223 (2013) - [j26]Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis:
Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013) - [j25]Elias Koutsoupias, George Pierrakos:
On the Competitive Ratio of Online Sampling Auctions. ACM Trans. Economics and Comput. 1(2): 10:1-10:10 (2013) - [c41]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230 - [c40]Elias Koutsoupias:
Prior-Free Auctions of Digital Goods. MFCS 2013: 43-44 - [c39]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Near-optimal multi-unit auctions with ordered bidders. EC 2013: 91-102 - 2012
- [j24]Carlos Fisch Brito, Elias Koutsoupias, Shailesh Vaya:
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? Algorithmica 64(4): 584-605 (2012) - [c38]Elias Koutsoupias, Katia Papakonstantinopoulou:
Contention Issues in Congestion Games. ICALP (2) 2012: 623-635 - [c37]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005 - [c36]Yiannis Giannakopoulos, Elias Koutsoupias:
Competitive Analysis of Maintaining Frequent Items of a Stream. SWAT 2012: 340-351 - [i4]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012) - [i3]Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden:
Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012) - 2011
- [j23]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. Algorithmica 61(1): 116-140 (2011) - [c35]Elias Koutsoupias:
Recent Developments in the Mechanism Design Problem for Scheduling. FAW-AAIM 2011: 6-7 - [c34]Elias Koutsoupias:
Scheduling without Payments. SAGT 2011: 143-153 - [e2]Ning Chen, Edith Elkind, Elias Koutsoupias:
Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings. Lecture Notes in Computer Science 7090, Springer 2011, ISBN 978-3-642-25509-0 [contents] - 2010
- [j22]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism design for fractional scheduling on unrelated machines. ACM Trans. Algorithms 6(2): 38:1-38:18 (2010) - [c33]Elias Koutsoupias, George Pierrakos:
On the Competitive Ratio of Online Sampling Auctions. WINE 2010: 327-338 - [e1]Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis:
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Lecture Notes in Computer Science 6386, Springer 2010, ISBN 978-3-642-16169-8 [contents]
2000 – 2009
- 2009
- [j21]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A Lower Bound for Scheduling Mechanisms. Algorithmica 55(4): 729-740 (2009) - [j20]Elias Koutsoupias, Christos H. Papadimitriou:
Worst-case equilibria. Comput. Sci. Rev. 3(2): 65-69 (2009) - [j19]Elias Koutsoupias:
The k-server problem. Comput. Sci. Rev. 3(2): 105-118 (2009) - [j18]George Christodoulou, Elias Koutsoupias:
Mechanism Design for Scheduling. Bull. EATCS 97: 40-59 (2009) - [j17]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009) - [j16]George Christodoulou, Elias Koutsoupias, Akash Nanavati:
Coordination mechanisms. Theor. Comput. Sci. 410(36): 3327-3336 (2009) - [c32]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262 - [c31]Luca Becchetti, Elias Koutsoupias:
Competitive Analysis of Aggregate Max in Windowed Streaming. ICALP (1) 2009: 156-170 - 2008
- [c30]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A Characterization of 2-Player Mechanisms for Scheduling. ESA 2008: 297-307 - [i2]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the performance of approximate equilibria in congestion games. CoRR abs/0804.3160 (2008) - [i1]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A characterization of 2-player mechanisms for scheduling. CoRR abs/0807.3427 (2008) - 2007
- [c29]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52 - [c28]Elias Koutsoupias, Angelina Vidali:
A Lower Bound of 1+phi for Truthful Scheduling Mechanisms. MFCS 2007: 454-464 - [c27]Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis:
Selfish Load Balancing Under Partial Knowledge. MFCS 2007: 609-620 - [c26]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A lower bound for scheduling mechanisms. SODA 2007: 1163-1170 - 2005
- [c25]George Christodoulou, Elias Koutsoupias:
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. ESA 2005: 59-70 - [c24]George Christodoulou, Elias Koutsoupias:
The price of anarchy of finite congestion games. STOC 2005: 67-73 - [c23]Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
Experiments with an Economic Model of the Worldwide Web. WINE 2005: 46-54 - [c22]Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
An economic model of the worldwide web. WWW (Special interest tracks and posters) 2005: 934-935 - 2004
- [j15]Marek Chrobak, Elias Koutsoupias:
Coordination mechanisms for congestion games. SIGACT News 35(4): 58-71 (2004) - [j14]Yair Bartal, Elias Koutsoupias:
On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci. 324(2-3): 337-345 (2004) - [j13]Elias Koutsoupias, David Scot Taylor:
The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004) - [c21]George Christodoulou, Elias Koutsoupias, Akash Nanavati:
Coordination Mechanisms. ICALP 2004: 345-357 - [c20]Elias Koutsoupias:
Congestion Games and Coordination Mechanisms. MFCS 2004: 177-179 - [c19]Carlos Brito, Elias Koutsoupias, Shailesh Vaya:
Competitive analysis of organization networks or multicast acknowledgement: how much to wait? SODA 2004: 627-635 - 2003
- [j12]Elias Koutsoupias:
Selfish Task Allocation. Bull. EATCS 81: 79-88 (2003) - [j11]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003) - [j10]Marek Chrobak, Elias Koutsoupias, John Noga:
More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003) - [c18]Elias Koutsoupias, Akash Nanavati:
The Online Matching Problem on a Line. WAOA 2003: 179-191 - 2002
- [j9]Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas:
On a model of indexability and its bounds for range queries. J. ACM 49(1): 35-55 (2002) - [c17]Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou:
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. ICALP 2002: 110-122 - [c16]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134 - [c15]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235 - 2000
- [j8]Elias Koutsoupias, Christos H. Papadimitriou:
Beyond Competitive Analysis. SIAM J. Comput. 30(1): 300-317 (2000) - [c14]Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker:
Optimization Problems in Congestion Control. FOCS 2000: 66-74 - [c13]Elias Koutsoupias, David Scot Taylor:
The CNN Problem and Other k-Server Variants. STACS 2000: 581-592 - [c12]Yair Bartal, Elias Koutsoupias:
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613
1990 – 1999
- 1999
- [j7]Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie:
Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999) - [j6]Eli Gafni, Elias Koutsoupias:
Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3): 970-983 (1999) - [c11]Elias Koutsoupias:
Weak Adversaries for the k-Server Problem. FOCS 1999: 444-449 - [c10]Elias Koutsoupias, David Scot Taylor:
Indexing Schemes for Random Points. SODA 1999: 596-602 - [c9]Elias Koutsoupias, Christos H. Papadimitriou:
Worst-case Equilibria. STACS 1999: 404-413 - 1998
- [c8]Elias Koutsoupias, David Scot Taylor:
Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58 - 1997
- [c7]Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou:
On the Analysis of Indexing Schemes. PODS 1997: 249-256 - 1996
- [j5]Elias Koutsoupias, Christos H. Papadimitriou:
The 2-Evader Problem. Inf. Process. Lett. 57(5): 249-252 (1996) - [c6]Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis:
Searching a Fixed Graph. ICALP 1996: 280-289 - 1995
- [j4]Elias Koutsoupias, Christos H. Papadimitriou:
On the k-Server Conjecture. J. ACM 42(5): 971-983 (1995) - [c5]Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou:
An Approximation Scheme for Planar Graph TSP. FOCS 1995: 640-645 - [c4]Eli Gafni, Elias Koutsoupias:
3-Processor Tasks Are Undecidable (Abstract). PODC 1995: 271 - 1994
- [c3]Elias Koutsoupias, Christos H. Papadimitriou:
Beyond Competitive Analysis. FOCS 1994: 394-400 - 1993
- [j3]Elias Koutsoupias:
Improvements on Khrapchenko's theorem. Theor. Comput. Sci. 116(2): 399-403 (1993) - [c2]Xiaotie Deng, Elias Koutsoupias:
Competitive Implementation of Parallel Programs. SODA 1993: 455-461 - 1992
- [j2]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
On the Optimal Bisection of a Polygon. INFORMS J. Comput. 4(4): 435-438 (1992) - [j1]Elias Koutsoupias, Christos H. Papadimitriou:
On the Greedy Algorithm for Satisfiability. Inf. Process. Lett. 43(1): 53-55 (1992) - 1990
- [c1]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
On the Optimal Bisection of a Polygon (Extended Abstract). SCG 1990: 198-202
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 2024-08-16 18:27 CEST 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:
