default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStavros G. Kolliopoulos
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Stavros G. Kolliopoulos, Antonis Skarlatos
:
Precedence-constrained covering problems with multiplicity constraints. J. Comb. Optim. 45(4): 106 (2023)- [c24]George Karakostas, Stavros G. Kolliopoulos:
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. APPROX/RANDOM 2023: 5:1-5:17 - 2022
- [c23]George Karakostas, Stavros G. Kolliopoulos:
Resource Time-Sharing for IoT Applications with Deadlines. ALGOSENSORS 2022: 91-107 - 2021
- [j21]Douglas G. Down, George Karakostas, Stavros G. Kolliopoulos, Somayye Rostami:
Single-item lot-sizing with quantity discount and bounded inventory. Oper. Res. Lett. 49(6): 877-882 (2021) - [c22]Stavros G. Kolliopoulos, Antonis Skarlatos:
Precedence-Constrained Covering Problems with Multiplicity Constraints. WAOA 2021: 234-251
2010 – 2019
- 2018
- [p1]Stavros G. Kolliopoulos:
Disjoint Paths and Unsplittable Flow. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j20]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - 2016
- [j19]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. Algorithmica 76(2): 401-425 (2016) - [j18]Stavros G. Kolliopoulos, Yannis Moysoglou:
Integrality gaps for strengthened linear relaxations of capacitated facility location. Math. Program. 158(1-2): 99-141 (2016) - 2015
- [c21]Stavros G. Kolliopoulos, Yannis Moysoglou:
Extended Formulation Lower Bounds via Hypergraph Coloring?. STACS 2015: 568-581 - [i8]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. CoRR abs/1511.04952 (2015) - 2014
- [c20]Stavros G. Kolliopoulos, Yannis Moysoglou:
Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location. APPROX-RANDOM 2014: 297-312 - [i7]Stavros G. Kolliopoulos, Yannis Moysoglou:
Extended Formulation Lower Bounds via Hypergraph Coloring? CoRR abs/1410.1150 (2014) - 2013
- [j17]Stavros G. Kolliopoulos, Yannis Moysoglou:
The 2-valued case of makespan minimization with assignment constraints. Inf. Process. Lett. 113(1-2): 39-43 (2013) - [i6]Stavros G. Kolliopoulos, Yannis Moysoglou:
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location. CoRR abs/1305.5998 (2013) - [i5]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR abs/1310.2378 (2013) - [i4]Stavros G. Kolliopoulos, Yannis Moysoglou:
Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location. CoRR abs/1312.0722 (2013) - [i3]Stavros G. Kolliopoulos, Yannis Moysoglou:
Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location. CoRR abs/1312.1819 (2013) - 2012
- [j16]George Karakostas, Stavros G. Kolliopoulos, Jing Wang:
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. ACM Trans. Algorithms 8(4): 40:1-40:16 (2012) - [i2]Stavros G. Kolliopoulos, Yannis Moysoglou:
The 2-valued case of makespan minimization with assignment constraints. CoRR abs/1212.1609 (2012) - 2011
- [c19]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Tight Bounds for Linkages in Planar Graphs. ICALP (1) 2011: 110-121 - [c18]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. IPEC 2011: 80-93 - 2010
- [c17]Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos:
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173
2000 – 2009
- 2009
- [j15]George Karakostas, Stavros G. Kolliopoulos:
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica 53(1): 132-153 (2009) - [j14]George Karakostas, Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica 53(2): 225-249 (2009) - [c16]George Karakostas, Stavros G. Kolliopoulos, Jing Wang:
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. COCOON 2009: 238-248 - 2007
- [j13]Stavros G. Kolliopoulos, George Steiner:
Partially ordered knapsack and applications to scheduling. Discret. Appl. Math. 155(8): 889-897 (2007) - [j12]Stavros G. Kolliopoulos, George Steiner:
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35(5): 685-692 (2007) - [j11]Stavros G. Kolliopoulos, Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. 37(3): 757-782 (2007) - [r1]Stavros G. Kolliopoulos:
Edge-Disjoint Paths and Unsplittable Flow. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j10]Stavros G. Kolliopoulos, George Steiner:
Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor. Comput. Sci. 355(3): 261-273 (2006) - [c15]George Karakostas, Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. COCOON 2006: 23-32 - 2005
- [j9]Stavros G. Kolliopoulos:
Minimum-cost single-source 2-splittable flow. Inf. Process. Lett. 94(1): 15-18 (2005) - [j8]Stavros G. Kolliopoulos, Neal E. Young:
Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71(4): 495-505 (2005) - [j7]Jingde Du, Stavros G. Kolliopoulos:
Implementing approximation algorithms for the single-source unsplittable flow problem. ACM J. Exp. Algorithmics 10 (2005) - 2004
- [j6]Stavros G. Kolliopoulos:
Minimum-Cost Single-Source 2-Splittable Flow. Electron. Notes Discret. Math. 17: 197-201 (2004) - [j5]Stavros G. Kolliopoulos, Clifford Stein:
Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1): 63-87 (2004) - [c14]George Karakostas, Stavros G. Kolliopoulos:
The Efficiency of Optimal Taxes. CAAN 2004: 3-12 - [c13]Stavros G. Kolliopoulos:
Minimum-Cost Single-Source 2-Splittable Flow. CTW 2004: 175-179 - [c12]George Karakostas, Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. FOCS 2004: 268-276 - [c11]Stavros G. Kolliopoulos, George Steiner:
On Minimizing the Total Weighted Tardiness on a Single Machine. STACS 2004: 176-186 - [c10]Jingde Du, Stavros G. Kolliopoulos:
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. WEA 2004: 213-227 - 2003
- [j4]Stavros G. Kolliopoulos:
Approximating covering integer programs with multiplicity constraints. Discret. Appl. Math. 129(2-3): 461-473 (2003) - [j3]Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for scheduling with rejection. J. Algorithms 49(1): 175-191 (2003) - 2002
- [c9]Stavros G. Kolliopoulos, George Steiner:
Partially-Ordered Knapsack and Applications to Scheduling. ESA 2002: 612-624 - [i1]Stavros G. Kolliopoulos, Neal E. Young:
Tight Approximation Results for General Covering Integer Programs. CoRR cs.DS/0205030 (2002) - 2001
- [j2]Stavros G. Kolliopoulos, Clifford Stein:
Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31(3): 919-946 (2001) - [c8]Stavros G. Kolliopoulos, Neal E. Young:
Tight Approximation Results for General Covering Integer Programs. FOCS 2001: 522-528 - 2000
- [c7]Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao:
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM 2000: 1624-1643
1990 – 1999
- 1999
- [c6]Stavros G. Kolliopoulos, Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA 1999: 378-389 - [c5]Stavros G. Kolliopoulos, Clifford Stein:
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO 1999: 328-344 - 1998
- [j1]Stavros G. Kolliopoulos, Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. J. Algorithms 28(1): 125-141 (1998) - [c4]Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for Scheduling with Rejection. ESA 1998: 490-501 - [c3]Stavros G. Kolliopoulos, Clifford Stein:
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168 - 1997
- [c2]Stavros G. Kolliopoulos, Clifford Stein:
Improved Approximation Algorithms for Unsplittable Flow Problems. FOCS 1997: 426-435 - 1996
- [c1]Stavros G. Kolliopoulos, Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths. IPCO 1996: 94-104
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-06-10 21:22 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:
