#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1998

2018

- This year (3)
- Last 5 years (30)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marios Gatzianas, Loukas Georgiadis, Leandros Tassiulas
- IEEE Transactions on Wireless Communications
- 2010

We consider the problem of cross-layer resource allocation for wireless networks operating with rechargeable batteries under general arrival, channel state and recharge processes. The objective is toâ€¦ (More)

- Lars Arge, Gerth StÃ¸lting Brodal, Loukas Georgiadis
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

We develop the first linear-space data structures for dynamic planar point location in general subdivisions that achieve logarithmic query time and poly-logarithmic update time

- Gerth StÃ¸lting Brodal, Loukas Georgiadis, Irit Katriel
- Oper. Res. Lett.
- 2008

We show that the minmax regret median of a tree can be found in O(n log n) time. This is obtained by a modification of Averbakh and Bermanâ€™s O(n log n)-time algorithm: We design a dynamic solution toâ€¦ (More)

- Loukas Georgiadis, Robert E. Tarjan, Renato F. Werneck
- J. Graph Algorithms Appl.
- 2004

The computation of dominators in a flowgraph has applications in program optimization, circuit testing, and other areas. Lengauer and Tarjan [17] proposed two versions of a fast algorithm for findingâ€¦ (More)

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been investigated forâ€¦ (More)

- Loukas Georgiadis
- ESA
- 2011

We consider the problem of approximating the smallest 2vertex connected spanning subgraph (2-VCSS) of a 2-vertex connected directed graph, and explore the efficiency of fast heuristics. First, weâ€¦ (More)

- Loukas Georgiadis
- ICALP
- 2010

We present an O(m+n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this result we design anâ€¦ (More)

- Loukas Georgiadis, Robert E. Tarjan
- SODA
- 2005

We present a linear-time algorithm that given a flowgraph <i>G</i> = (<i>V,A,r</i>) and a tree <i>T</i>, checks whether <i>T</i> is the dominator tree of <i>G</i>. Also we prove that there exist twoâ€¦ (More)

The problem of finding dominators in a flowgraph arises in many kinds of global code optimization and other settings. In 1979 Lengauer and Tarjan gave an almost-linear-time algorithm to findâ€¦ (More)

We study algorithms for the minimum mean cycle problem, a parametric version of shortest path feasibility (SPF). The three basic approaches to the problem are cycle-based, binary search, andâ€¦ (More)