| Publication | Date of Publication | Type |
|---|
Maximizing the number of requests in oriented trees with a grooming factor
Discrete Applied Mathematics | 2026-02-11 | Paper |
New lower bounds on the cutwidth of graphs
Computers & Operations Research | 2025-09-10 | Paper |
Gossiping with interference in radio ring networks
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
| Gossiping in Cayley graphs by packets | 2024-07-05 | Paper |
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
European Journal of Combinatorics | 2024-06-28 | Paper |
| Grabbing olives on linear pizzas and pissaladières | 2024-05-16 | Paper |
Distributed link scheduling in wireless networks
Discrete Mathematics, Algorithms and Applications | 2021-04-09 | Paper |
| How long does it take for all users in a social network to choose their communities? | 2020-08-11 | Paper |
How long does it take for all users in a social network to choose their communities?
Discrete Applied Mathematics | 2019-11-06 | Paper |
On spectrum assignment in elastic optical tree-networks
Discrete Applied Mathematics | 2019-03-11 | Paper |
Fast gossiping by short messages
Automata, Languages and Programming | 2019-01-10 | Paper |
Bin packing with colocations
Approximation and Online Algorithms | 2017-04-04 | Paper |
Round weighting problem and gathering in radio networks with symmetrical interference
Discrete Mathematics, Algorithms and Applications | 2016-07-08 | Paper |
Well-balanced designs for data placement
Journal of Combinatorial Designs | 2016-05-24 | Paper |
Finding disjoint paths in networks with star shared risk link groups
Theoretical Computer Science | 2015-05-18 | Paper |
Data gathering and personalized broadcasting in radio grids with interference
Theoretical Computer Science | 2014-12-02 | Paper |
Eulerian and Hamiltonian dicycles in directed hypergraphs
Discrete Mathematics, Algorithms and Applications | 2014-04-25 | Paper |
Directed acyclic graphs with the unique dipath property
Theoretical Computer Science | 2014-01-16 | Paper |
Optimal time data gathering in wireless networks with multidirectional antennas
Theoretical Computer Science | 2014-01-13 | Paper |
GATHERING RADIO MESSAGES IN THE PATH
Discrete Mathematics, Algorithms and Applications | 2013-06-11 | Paper |
Weighted improper colouring
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Optimal gathering in radio grids with interference
Theoretical Computer Science | 2012-10-11 | Paper |
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science | 2012-08-10 | Paper |
Line directed hypergraphs
Cryptography and Security: From Theory to Applications | 2012-06-08 | Paper |
Traffic grooming in bidirectional WDM ring networks
Networks | 2012-01-18 | Paper |
Weighted Improper Colouring
Lecture Notes in Computer Science | 2012-01-13 | Paper |
The \(\alpha \)-arboricity of complete uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Drop cost and wavelength optimal two-period grooming with ratio 4
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Improper coloring of weighted grid and hexagonal graphs
Discrete Mathematics, Algorithms and Applications | 2010-12-15 | Paper |
Designing hypergraph layouts to GMPLS routing strategies
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Optimal gathering protocols on paths under interference constraints
Discrete Mathematics | 2009-12-15 | Paper |
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Gathering with Minimum Delay in Tree Sensor Networks
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Traffic grooming on the path
Theoretical Computer Science | 2007-10-02 | Paper |
Vertex disjoint routings of cycles over tori
Networks | 2007-05-23 | Paper |
Gathering Algorithms on Paths Under Interference Constraints
Lecture Notes in Computer Science | 2007-05-02 | 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 Ratio<i>C</i>= 6
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Fault tolerant on-board networks with priorities
Networks | 2006-03-24 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Hierarchical ring network design
Theory of Computing Systems | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2102779 (Why is no real title available?) | 2004-09-24 | Paper |
Grooming in unidirectional rings: \(K_{4}-e\) designs
Discrete Mathematics | 2004-08-20 | Paper |
Deadlock prevention by acyclic orientations
Discrete Applied Mathematics | 2003-07-30 | Paper |
On Hamilton cycle decompositions of the tensor product of complete graphs
Discrete Mathematics | 2003-07-29 | Paper |
Directed virtual path layouts in ATM networks
Theoretical Computer Science | 2003-05-14 | Paper |
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
Networks | 2003-04-10 | Paper |
On DRC‐covering of K<sub>n</sub> by cycles
Journal of Combinatorial Designs | 2003-04-03 | Paper |
Design of fault-tolerant networks for satellites (TWTA redundancy)
Networks | 2003-03-19 | Paper |
A broadcasting protocol in line digraphs
Journal of Parallel and Distributed Computing | 2002-06-30 | Paper |
Efficient collective communciation in optical networks
Theoretical Computer Science | 2000-08-23 | Paper |
Symmetric flows and broadcasting in hypercubes
Annales de l’institut Fourier | 1999-07-12 | Paper |
Symmetric flows and broadcasting in hypercubes
Annales de l’institut Fourier | 1999-07-12 | Paper |
Optimal sequential gossiping by short messages
Discrete Applied Mathematics | 1998-11-03 | Paper |
Hamilton circuits in the directed wrapped Butterfly network
Discrete Applied Mathematics | 1998-10-18 | Paper |
| scientific article; zbMATH DE number 1107721 (Why is no real title available?) | 1998-09-27 | Paper |
Fast Gossiping by Short Messages
SIAM Journal on Computing | 1998-09-20 | Paper |
A Note on the Dimensionality of Modified Knödel Graphs
International Journal of Foundations of Computer Science | 1997-11-20 | Paper |
| De Bruijn and Kautz bus networks | 1997-11-06 | Paper |
| Mean eccentricities of de Bruijn networks | 1997-11-06 | Paper |
Bus interconnection networks
Discrete Applied Mathematics | 1996-11-25 | Paper |
Antepenultimate broadcasting
Networks | 1996-10-07 | Paper |
Broadcasting and Gossiping in de Bruijn Networks
SIAM Journal on Computing | 1994-03-27 | Paper |
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
Journal of Graph Theory | 1993-12-10 | Paper |
Connectivity of Kautz networks
Discrete Mathematics | 1993-10-24 | Paper |
Broadcasting in wraparound meshes with parallel monodirectional links
Parallel Computing | 1993-01-16 | Paper |
Table of large \(({\Delta{}}, D)\)-graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
Sparse broadcast graphs
Discrete Applied Mathematics | 1992-09-27 | Paper |
Broadcasting in Bounded Degree Graphs
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Minimal diameter double-loop networks: Dense optimal families
Networks | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4173021 (Why is no real title available?) | 1990-01-01 | Paper |
Existence of resolvable path designs
European Journal of Combinatorics | 1990-01-01 | Paper |
On resolvable mixed path designs
European Journal of Combinatorics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4201663 (Why is no real title available?) | 1989-01-01 | Paper |
Hamiltonian decomposition of Cayley graphs of degree 4
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Induced Subgraphs of the Power of a Cycle
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Large fault-tolerant interconnection networks
Graphs and Combinatorics | 1989-01-01 | Paper |
A graph theoretical approach to equivalence of multistage interconnection networks
Discrete Applied Mathematics | 1989-01-01 | Paper |
Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4102999 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4058843 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3934416 (Why is no real title available?) | 1985-01-01 | Paper |
On linear k-arboricity
Discrete Mathematics | 1984-01-01 | Paper |
Large graphs with given degree and diameter. II
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
Regular factors in nearly regular graphs
Discrete Mathematics | 1984-01-01 | Paper |
Shortest coverings of graphs with cycles
Journal of Combinatorial Theory. Series B | 1983-01-01 | Paper |
Grands Graphes De Degré Et Diamètre Fixés
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
Tables of large graphs with given degree and diameter
Information Processing Letters | 1982-01-01 | Paper |
Sur Un Probleme Combinatoire D'Antennes En Radioastronomie II
Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday | 1982-01-01 | Paper |
Large Graphs with Given Degree and Diameter III
Graph Theory, Proceedings of the Conference on Graph Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3794103 (Why is no real title available?) | 1981-01-01 | Paper |
Cycles in digraphs– a survey
Journal of Graph Theory | 1981-01-01 | Paper |
Longest paths in digraphs
Combinatorica | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3710227 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3679864 (Why is no real title available?) | 1980-01-01 | Paper |
Chemins Et Circuits Dans Les Graphes Orientes
Combinatorics 79 Part I | 1980-01-01 | Paper |
Girth in digraphs
Journal of Graph Theory | 1980-01-01 | Paper |
On the maximum number of edges in a hypergraph whose linegraph contains no cycle
Discrete Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3698968 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655970 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3619945 (Why is no real title available?) | 1979-01-01 | Paper |
Resolvable decomposition of K^*_n
Journal of Combinatorial Theory. Series A | 1979-01-01 | Paper |
Hamiltonian Cycles in Strong Products of Graphs
Canadian Mathematical Bulletin | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3668667 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3614796 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3641483 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3675916 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3639635 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3641489 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3616471 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3634285 (Why is no real title available?) | 1978-01-01 | Paper |
Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
Advances in Graph Theory | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3637897 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3611379 (Why is no real title available?) | 1977-01-01 | Paper |
\(G\)-decomposition of \(K_n\), where G has four vertices or less
Discrete Mathematics | 1977-01-01 | Paper |
On a Conjecture of Chvátal on <i>m</i> -Intersecting Hypergraphs
Bulletin of the London Mathematical Society | 1977-01-01 | Paper |
Line graphs of hypergraphs. I
Discrete Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3515497 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3517174 (Why is no real title available?) | 1976-01-01 | Paper |
Decomposition of the complete directed graph into k-circuits
Journal of Combinatorial Theory. Series B | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3525152 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3496201 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3472085 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3463687 (Why is no real title available?) | 1974-01-01 | Paper |
Nombre Chromatique Total Du Graphe <i>R</i> -Parti Complet
Journal of the London Mathematical Society | 1974-01-01 | Paper |
Some Ramsey nu mbers for directed graphs
Discrete Mathematics | 1974-01-01 | Paper |
An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
Discrete Mathematics | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3427393 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3378948 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3378948 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3375527 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3312527 (Why is no real title available?) | 1970-01-01 | Paper |
