| Publication | Date of Publication | Type |
|---|
Leanness computation: small values and special graph classes
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
Finding the \(k\) shortest simple paths: time and space trade-offs
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
Computing graph hyperbolicity using dominating sets
| 2024-05-24 | Paper |
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Low time complexity algorithms for path computation in Cayley graphs
Discrete Applied Mathematics | 2019-03-28 | Paper |
On distance-preserving elimination orderings in graphs: complexity and algorithms
Discrete Applied Mathematics | 2018-05-24 | Paper |
Computing and maximizing the exact reliability of wireless backhaul networks
| 2018-04-11 | Paper |
Revisiting decomposition by clique separators
SIAM Journal on Discrete Mathematics | 2018-04-06 | Paper |
scientific article; zbMATH DE number 6850484 (Why is no real title available?)
| 2018-03-15 | Paper |
A simple approach for lower-bounding the distortion in any hyperbolic embedding
| 2018-01-18 | Paper |
Applying clique-decomposition for computing Gromov hyperbolicity
Theoretical Computer Science | 2017-08-24 | Paper |
Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Bin packing with colocations
Approximation and Online Algorithms | 2017-04-04 | Paper |
Combinatorial optimization in networks with shared risk link groups
| 2017-03-03 | Paper |
Robust energy-aware routing with redundancy elimination
Computers & Operations Research | 2016-11-17 | Paper |
On computing the Gromov hyperbolicity
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
On the hyperbolicity of bipartite graphs and intersection graphs
Discrete Applied Mathematics | 2016-09-30 | Paper |
To approximate treewidth, use treelength!
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
Data center interconnection networks are not hyperbolic
Theoretical Computer Science | 2016-06-30 | Paper |
On computing the hyperbolicity of real-world graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Non-deterministic graph searching in trees
Theoretical Computer Science | 2015-05-18 | Paper |
Finding disjoint paths in networks with star shared risk link groups
Theoretical Computer Science | 2015-05-18 | Paper |
Chance-constrained optimization of reliable fixed broadband wireless networks
INFORMS Journal on Computing | 2015-01-26 | Paper |
Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Connectivity inference in mass spectrometry based structure determination
Lecture Notes in Computer Science | 2013-09-17 | Paper |
On rerouting connection requests in networks with shared bandwidth
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science | 2012-08-10 | Paper |
A distributed algorithm for computing the node search number in trees
Algorithmica | 2012-04-26 | Paper |
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science | 2011-09-12 | Paper |
A chance-constrained model and cutting planes for fixed broadband wireless networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics | 2011-08-10 | Paper |
Designing hypergraph layouts to GMPLS routing strategies
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Traffic Grooming: Combinatorial Results and Practical Resolutions
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Edge-simple circuits through 10 ordered vertices in square grids
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Traffic grooming on the path
Theoretical Computer Science | 2007-10-02 | Paper |
Pathwidth of outerplanar graphs
Journal of Graph Theory | 2007-06-11 | Paper |
scientific article; zbMATH DE number 5130679 (Why is no real title available?)
| 2007-03-05 | Paper |
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On DRC‐covering of Kn by cycles
Journal of Combinatorial Designs | 2003-04-03 | Paper |
Isomorphisms of the De Bruijn digraph and free‐space optical networks
Networks | 2002-12-17 | Paper |
