The SCEAS System
| |||||||

## Search the dblp DataBase
Ljubomir Perkovic:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Iyad A. Kanj, Ljubomir Perkovic
**Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.**[Citation Graph (0, 0)][DBLP] ALGOSENSORS, 2006, pp:95-106 [Conf] - Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
**Genus Characterizes the Complexity of Graph Problems: Some Tight Results.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:845-856 [Conf] - Iyad A. Kanj, Ljubomir Perkovic
**Improved Parameterized Algorithms for Planar Dominating Set.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:399-410 [Conf] - André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
**New Bounds for the Firing Squad Problem on a Ring.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2002, pp:17-31 [Conf] - Ljubomir Perkovic, Bruce A. Reed
**An Improved Algorithm for Finding Tree Decompositions of Small Width.**[Citation Graph (0, 0)][DBLP] WG, 1999, pp:148-154 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:271-284 [Journal] - Ljubomir Perkovic, Bruce A. Reed
**An Improved Algorithm for Finding Tree Decompositions of Small Width.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:365-371 [Journal] - Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
**Inexpensive d-dimensional matchings.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:20, n:1, pp:50-58 [Journal] - André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon
**Bounding the firing synchronization problem on a ring.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:320, n:2-3, pp:213-228 [Journal] - Ljubomir Perkovic, Bruce A. Reed
**Edge coloring regular graphs of high degree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:567-578 [Journal] - Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
**Genus characterizes the complexity of certain graph problems: Some tight results.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:6, pp:892-907 [Journal] **Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**Computing Branches Out: On Revitalizing Computing Education.**[Citation Graph (, )][DBLP]**Plane Spanners of Maximum Degree Six.**[Citation Graph (, )][DBLP]**On Geometric Spanners of Euclidean and Unit Disk Graphs.**[Citation Graph (, )][DBLP]**Computing Lightweight Spanners Locally.**[Citation Graph (, )][DBLP]**A framework for computational thinking across the curriculum.**[Citation Graph (, )][DBLP]**File references, trees, and computational thinking.**[Citation Graph (, )][DBLP]**On Geometric Spanners of Euclidean and Unit Disk Graphs**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |