A survey of graph layout problems
ACM Computing Surveys (CSUR)
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
On Range Matrices and Wireless Networks in d Dimensions
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
Graph bandwidth of weighted caterpillars
Theoretical Computer Science - Algorithmic applications in management
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Theoretical Computer Science
Theoretical Computer Science
Large independent sets in general random intersection graphs
Theoretical Computer Science
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Balanced cut approximation in random geometric graphs
Theoretical Computer Science
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
A lower bound on the capacity of wireless erasure networks with random node locations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
The second eigenvalue of random walks on symmetric random intersection graphs
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
IEEE Transactions on Communications
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Algorithms for wireless sensor networks: design, analysis and experimental evaluation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Models and algorithms for wireless sensor networks (smart dust)
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Balanced cut approximation in random geometric graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On cutwidth parameterized by vertex cover
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Expander properties and the cover time of random intersection graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Quantitative analysis of multi-hop wireless networks using a novel paradigm
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.01 |