| 2008 |
|---|
| 16 | EE | Iyad A. Kanj,
Ljubomir Perkovic,
Ge Xia:
Computing Lightweight Spanners Locally.
DISC 2008: 365-378 |
| 15 | EE | Iyad A. Kanj,
Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs.
STACS 2008: 409-420 |
| 14 | EE | Iyad A. Kanj,
Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs
CoRR abs/0802.2864: (2008) |
| 2007 |
|---|
| 13 | | Iyad A. Kanj,
Ljubomir Perkovic,
Ge Xia:
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.
DIALM-POMC 2007 |
| 12 | | Ljubomir Perkovic,
Amber Settle:
Computing Branches Out: On Revitalizing Computing Education.
FECS 2007: 22-27 |
| 11 | EE | Jianer Chen,
Iyad A. Kanj,
Ljubomir Perkovic,
Eric Sedgwick,
Ge Xia:
Genus characterizes the complexity of certain graph problems: Some tight results.
J. Comput. Syst. Sci. 73(6): 892-907 (2007) |
| 2006 |
|---|
| 10 | EE | Iyad A. Kanj,
Ljubomir Perkovic:
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.
ALGOSENSORS 2006: 95-106 |
| 2004 |
|---|
| 9 | EE | André Berthiaume,
Todd Bittner,
Ljubomir Perkovic,
Amber Settle,
Janos Simon:
Bounding the firing synchronization problem on a ring.
Theor. Comput. Sci. 320(2-3): 213-228 (2004) |
| 2003 |
|---|
| 8 | EE | Jianer Chen,
Iyad A. Kanj,
Ljubomir Perkovic,
Eric Sedgwick,
Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results.
ICALP 2003: 845-856 |
| 2002 |
|---|
| 7 | EE | Iyad A. Kanj,
Ljubomir Perkovic:
Improved Parameterized Algorithms for Planar Dominating Set.
MFCS 2002: 399-410 |
| 6 | | André Berthiaume,
Ljubomir Perkovic,
Amber Settle,
Janos Simon:
New Bounds for the Firing Squad Problem on a Ring.
SIROCCO 2002: 17-31 |
| 5 | | Bae-Shi Huang,
Ljubomir Perkovic,
Eric Schmutz:
Inexpensive d-dimensional matchings.
Random Struct. Algorithms 20(1): 50-58 (2002) |
| 2000 |
|---|
| 4 | | Ljubomir Perkovic,
Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width.
Int. J. Found. Comput. Sci. 11(3): 365-371 (2000) |
| 1999 |
|---|
| 3 | EE | Ljubomir Perkovic,
Bruce A. Reed:
An Improved Algorithm for Finding Tree Decompositions of Small Width.
WG 1999: 148-154 |
| 1997 |
|---|
| 2 | EE | Ljubomir Perkovic,
Bruce A. Reed:
Edge coloring regular graphs of high degree.
Discrete Mathematics 165-166: 567-578 (1997) |
| 1993 |
|---|
| 1 | | Martin E. Dyer,
Alan M. Frieze,
Ravi Kannan,
Ajai Kapoor,
Ljubomir Perkovic,
Umesh V. Vazirani:
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
Combinatorics, Probability & Computing 2: 271-284 (1993) |
