| Publication | Date of Publication | Type |
|---|
Nonexistence of uniformly most reliable graphs of least corank
Discrete Applied Mathematics | 2025-12-16 | Paper |
Least corank for the nonexistence of uniformly most reliable graphs
Procedia Computer Science | 2025-12-11 | Paper |
Most reliable graphs with reduced corank
Discrete Applied Mathematics | 2025-12-11 | Paper |
| There are finitely many uniformly most reliable graphs of corank 5 | 2025-06-20 | Paper |
| An algebraic characterization of strong graphs | 2025-06-20 | Paper |
Characterization of locally most split reliable graphs
Theoretical Computer Science | 2025-06-19 | Paper |
Corrigendum to: ``On maximum graphs in Tutte polynomial posets''
Discrete Applied Mathematics | 2025-05-19 | Paper |
Factorization and exact evaluation of the source-terminal diameter-constrained reliability
Networks | 2024-05-03 | Paper |
| Wagner and Petersen are uniformly most-reliable graphs | 2024-01-10 | Paper |
A simple proof of the Gross‐Saccoman multigraph conjecture
Networks | 2023-12-12 | Paper |
Uniformly optimally reliable graphs: A survey
Networks | 2023-12-12 | Paper |
Exact reliability optimization for series‐parallel graphs using convex envelopes
Networks | 2023-12-12 | Paper |
The <scp>Gross–Saccoman</scp> conjecture is true
Networks | 2023-12-11 | Paper |
On the reliability estimation of stochastic binary systems
International Transactions in Operational Research | 2023-11-27 | Paper |
Complexity and heuristics for the weighted max cut‐clique problem
International Transactions in Operational Research | 2023-11-24 | Paper |
Graph fragmentation problem: analysis and synthesis
International Transactions in Operational Research | 2023-11-15 | Paper |
| Nonexistence of uniformly most reliable graphs of least corank | 2023-03-01 | Paper |
| Man power optimization in large-scale corporations | 2021-09-24 | Paper |
| Finding uniformly most reliable graphs by counting trivial cuts | 2020-12-08 | Paper |
| A Hostile model for network reliability analysis | 2018-08-06 | Paper |
Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
Networks | 2018-05-23 | Paper |
Two-node-connected star problem
International Transactions in Operational Research | 2018-05-22 | Paper |
Complexity among combinatorial problems from epidemics
International Transactions in Operational Research | 2018-03-16 | Paper |
Diameter constrained reliability of ladders and Spanish fans
Yugoslav Journal of Operations Research | 2017-07-19 | Paper |
Resilient overlay design in DWDM systems
Yugoslav Journal of Operations Research | 2017-07-19 | Paper |
Optimum piece selection strategies for a peer-to-peer video streaming platform
Computers & Operations Research | 2017-01-05 | Paper |
| Capacitated m two-node survivable star problem | 2016-10-18 | Paper |
A multi-tree committee to assist port-of-entry inspection decisions
European Journal of Operational Research | 2016-10-07 | Paper |
Full complexity analysis of the diameter-constrained reliability
International Transactions in Operational Research | 2016-05-18 | Paper |
Nash equilibrium in evolutionary competitive models of firms and workers under external regulation
Journal of Dynamics and Games | 2016-03-10 | Paper |
Analysis and design of peer-assisted video-on-demand services
International Transactions in Operational Research | 2015-02-25 | Paper |
An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks
International Journal of Metaheuristics | 2015-02-23 | Paper |
| A Full Characterization of Irrelevant Components in Diameter Constrained Reliability | 2014-10-01 | Paper |
Optimal bandwidth allocation in mesh-based peer-to-peer streaming networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Diagrammatic Representation and Inference
Lecture Notes in Computer Science | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 2086752 (Why is no real title available?) | 2004-08-11 | Paper |
Focal structures and information types in Prolog
International Journal of Human-Computer Studies | 2003-04-03 | Paper |
