Kostas Floros

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:18/2621 · DBLP profile ↗

← Back

2ranked-venue papers

0as first author

0since 2021 · last 2002

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks

2 papers

Network optimization and economics · 64% Internet architecture and protocols · 16% Datacenter networks · 16%

Topics — the 6 heaviest of 6, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Network optimization and economics › resource allocation bandwidth allocation	0.1	2	2002	Lexicographically optimal balanced networks · IEEE/ACM Trans. Netw. 2002 Lexicographically Optimal Balanced Networks · INFOCOM 2001
Network optimization and economics › multi-criteria decision making lexicographic optimization	0.1	2	2002	Lexicographically optimal balanced networks · IEEE/ACM Trans. Netw. 2002 Lexicographically Optimal Balanced Networks · INFOCOM 2001
Internet architecture and protocols › wide area network backbone network	0.0	1	2002	Lexicographically optimal balanced networks · IEEE/ACM Trans. Netw. 2002
Datacenter networks load balancing	0.0	1	2002	Lexicographically optimal balanced networks · IEEE/ACM Trans. Netw. 2002
Network optimization and economics network design	0.0	1	2002	Lexicographically optimal balanced networks · IEEE/ACM Trans. Netw. 2002
Routing and switching › wireless routing routing backbone	0.0	1	2001	Lexicographically Optimal Balanced Networks · INFOCOM 2001

Methods — techniques the papers use, named apart from their topics

lexicographic optimization · 0.1algorithm design · 0.0graph algorithms · 0.0

Year	Publication	Venue	Position
2002	Lexicographically optimal balanced networks abstract We consider the problem of allocating bandwidth between two endpoints of a backbone network so that no parts of the network are unnecessarily loaded. We formulate the problem as lexicographic optimization and develop algorithms for its solution. The solution consists of: (1) identifying a cut in the network where the optimal load can be determined on all the links of the cut and (2) considering the same problem for each of the subnetworks to which the cut is dividing the original network. Leonidas Georgiadis, Panos Georgatsos, Kostas Floros, Stelios Sartzetakis	IEEE/ACM Trans. Netw.	3
2001	Lexicographically Optimal Balanced Networks abstract We consider the problem of allocating bandwidth between two endpoints of a backbone network so that no parts of the network are unnecessarily loaded. We formulate the problem as lexicographic optimization, and develop algorithms for its solution. The solution consists of (a) identifying a cut in the network where the optimal load can be determined on all the links of the cut, and (b) considering the same problem in each of the subnetworks to which the cut is dividing the original network. Leonidas Georgiadis, Panos Georgatsos, Kostas Floros, Stelios Sartzetakis	INFOCOM	3