Bernard Mans

According to our database1, Bernard Mans authored at least 86 papers between 1994 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Green Mining: toward a less energetic impact of cryptocurrencies.
IACR Cryptology ePrint Archive, 2018

A Graph Model with Indirect Co-location Links.
CoRR, 2018

Impact of Indirect Contacts in Emerging Infectious Disease on Social Networks.
CoRR, 2018

Green Mining: toward a less energetic impact of cryptocurrencies.
CoRR, 2018

2017
Incremental Problems in the Parameterized Complexity Setting.
Theory Comput. Syst., 2017

Information Dissemination in Vehicular Networks in an Urban Hyperfractal Topology.
CoRR, 2017

Resource demand aware scheduling for workflows in clouds.
Proceedings of the 16th IEEE International Symposium on Network Computing and Applications, 2017

Airborne Disease Propagation on Large Scale Social Contact Networks.
Proceedings of the 2nd International Workshop on Social Sensing, 2017

2016
Distributed Alarming in the On-Duty and Off-Duty Models.
IEEE/ACM Trans. Netw., 2016

On the Throughput-Delay Tradeoff in Georouting Networks.
IEEE Trans. Information Theory, 2016

Functional graphs of polynomials over finite fields.
J. Comb. Theory, Ser. B, 2016

Complete Balancing via Rotation.
Comput. J., 2016

Information propagation speed in large scale mobile and intermittently connected networks.
Proceedings of the 2016 IEEE International Conference on Pervasive Computing and Communication Workshops, 2016

2015
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks.
Int. J. Found. Comput. Sci., 2015

2014
On the treewidth of dynamic graphs.
Theor. Comput. Sci., 2014

Measuring Temporal Lags in Delay-Tolerant Networks.
IEEE Trans. Computers, 2014

Random Walks, Bisections and Gossiping in Circulant Graphs.
Algorithmica, 2014

2013
On the exploration of time-varying networks.
Theor. Comput. Sci., 2013

Functional Graphs of Polynomials over Finite Fields.
CoRR, 2013

Multi-lane vehicle-to-vehicle networks with time-varying radio ranges: Information propagation speed properties.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the Treewidth of Dynamic Graphs.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties.
IEEE Trans. Information Theory, 2012

A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast
CoRR, 2012

Building Fastest Broadcast Trees in Periodically-Varying Graphs
CoRR, 2012

Random Walks and Bisections in Random Circulant Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On the throughput-delay trade-off in georouting networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
On the Treewidth of Dynamic Graphs
CoRR, 2011

On the Throughput-Delay Trade-off in Georouting Networks
CoRR, 2011

On the Feasibility of Maintenance Algorithms in Dynamic Graphs
CoRR, 2011

Measuring Temporal Lags in Delay-Tolerant Networks.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Information propagation speed in bidirectional vehicular delay tolerant networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Information propagation speed in mobile and delay tolerant networks.
IEEE Trans. Information Theory, 2010

Network Exploration by Silent and Oblivious Robots.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility.
Proceedings of the Theoretical Computer Science, 2010

2009
Opportunistic Routing in Wireless Ad Hoc Networks: Upper Bounds for the Packet Propagation Speed.
IEEE Journal on Selected Areas in Communications, 2009

Connected domination of regular graphs.
Discrete Mathematics, 2009

On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
CoRR, 2009

Exploration of Periodically Varying Graphs
CoRR, 2009

Information Propagation Speed in Mobile and Delay Tolerant Networks
CoRR, 2009

Broadcast delay of epidemic routing in intermittently connected networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Exploration of Periodically Varying Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Information Propagation Speed in Mobile and Delay Tolerant Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Distributed Disaster Disclosure.
Proceedings of the Algorithm Theory, 2008

Opportunistic routing in wireless ad hoc networks: Upper bounds for the packet propagation speed.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

Information propagation speed in Delay Tolerant Networks: Analytic upper bounds.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Tree Decontamination with Temporary Immunity.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Routing in Intermittently Connected Networks: Age Rumors in Connected Components.
Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications, 2007

Exploiting Overhearing: Flow-Aware Routing for Improved Lifetime in Ad Hoc Networks.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

2006
Energy-Efficient Virtual Backbones for Reception-Aware MANET.
Proceedings of the 63rd IEEE Vehicular Technology Conference, 2006

2005
Randomized greedy algorithms for finding small k-dominating sets of regular graphs.
Random Struct. Algorithms, 2005

Efficient trigger-broadcasting in heterogeneous clusters.
J. Parallel Distrib. Comput., 2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experience.
Int. J. Found. Comput. Sci., 2005

Routing in Extremely Mobile Networks.
Proceedings of the Challenges in Ad Hoc Networking, 2005

Reducing the energy drain in multihop ad hoc networks.
Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

2004
Bisecting and Gossiping in Circulant Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Bandwidth Reservation in Multihop Wireless Networks: Complexity and Mechanisms.
Proceedings of the 24th International Conference on Distributed Computing Systems Workshops (ICDCS 2004 Workshops), 2004

2003
Sense of direction in distributed computing.
Theor. Comput. Sci., 2003

Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
On the spectral Ádám property for circulant graphs.
Discrete Mathematics, 2002

Small k-Dominating Sets of Regular Graphs.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

On the Connected Domination Number of Random Regular Graphs.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Interval routing schemes allow broadcasting with linear message-complexity.
Distributed Computing, 2001

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On Recognizing Cayley Graphs.
Proceedings of the Algorithms, 2000

1999
On the Interval Routing of Chordal Rings.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

On Routing in Circulant Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Optimal Elections in Faulty Loop Networks and Applications.
IEEE Trans. Computers, 1998

Sense of direction: Definitions, properties, and classes.
Networks, 1998

A Note on the Ádám Conjecture for Double Loops.
Inf. Process. Lett., 1998

Portable distributed priority queues with MPI.
Concurrency - Practice and Experience, 1998

Sense of Direction in Distributed Computing.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

On the Ádám Conjecture on Circulant Graphs.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings.
J. Parallel Distrib. Comput., 1997

On the Impact of Sense of Direction on Message Complexity.
Inf. Process. Lett., 1997

Levels of Sense of Direction in Distributed Systems.
Proceedings of the On Principles Of Distributed Systems, 1997

1996
Optimal Elections in Labeled Hypercubes.
J. Parallel Distrib. Comput., 1996

Performances of Parallel Branch and Bound Algorithms with Best-first Search.
Discrete Applied Mathematics, 1996

Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings.
Proceedings of the SIROCCO'96, 1996

1995
Translation Capabilities of Sense of Direction.
Proceedings of the Structure, Information and Communication Complexity, 1995

1994
Optimal Coteries and Voting Schemes.
Inf. Process. Lett., 1994

Sense of Direction: Formal Definitions and Properties.
Proceedings of the Structural Information and Communication Complexity, 1994

Preface.
Proceedings of the Structural Information and Communication Complexity, 1994

On the Impact of Sense of Direction in Arbitrary Networks.
Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

Optimal Fault-Tolerant Leader Election in Chordal Rings.
Proceedings of the Digest of Papers: FTCS/24, 1994


  Loading...