| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
Algorithmica
|
| 2026 | J | jnl |
Theor. Comput. Sci.
|
| 2026 | J | jnl |
Theor. Comput. Sci.
|
| 2025 | A | conf |
CP
|
| 2025 | A | conf |
STACS
|
| 2025 | J | jnl |
CoRR
|
| 2025 | Misc | ed. |
ICDCIT
|
| 2025 | A* | conf |
ICALP
|
| 2025 | J | jnl |
Discret. Appl. Math.
|
| 2025 | J | jnl |
Theor. Comput. Sci.
|
| 2025 | C | conf |
SSS
|
| 2024 | A* | conf |
PODC
|
| 2024 | Misc | ed. |
ICDCIT
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A* | conf |
PODC
|
| 2024 | C | conf |
SSS
|
| 2024 | J | jnl |
Theor. Comput. Sci.
|
| 2023 | J | jnl |
Theor. Comput. Sci.
|
| 2023 | J | jnl |
Theor. Comput. Sci.
|
| 2023 | A | conf |
DISC
|
| 2023 | C | conf |
SSS
|
| 2023 | J | jnl |
CoRR
|
| 2023 | C | conf |
SSS
|
| 2023 | J | jnl |
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality.
Theor. Comput. Sci.
|
| 2023 | Misc | conf |
ICDCN
|
| 2023 | J | jnl |
Theor. Comput. Sci.
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
Comput. J.
|
| 2022 | Misc | conf |
FUN
|
| 2022 | J | jnl |
Algorithmica
|
| 2022 | J | jnl |
Inf. Comput.
|
| 2022 | C | ed. |
SSS
|
| 2021 | Misc | conf |
ICDCN
|
| 2021 | Misc | conf |
FUN
|
| 2021 | A* | conf |
PODC
|
| 2021 | Misc | conf |
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality.
ICDCN
|
| 2021 | — | conf |
NETYS
|
| 2021 | Misc | conf |
ICDCN
|
| 2021 | J | jnl |
Comput. J.
|
| 2020 | A* | conf |
PODC
|
| 2020 | J | jnl |
J. Parallel Distributed Comput.
|
| 2020 | — | conf |
NETYS
|
| 2020 | C | ed. |
SSS
|
| 2020 | — | book |
|
| 2020 | — | conf |
TAP@STAF
|
| 2019 | J | jnl |
Theor. Comput. Sci.
|
| 2019 | J | jnl |
CoRR
|
| 2019 | C | conf |
SSS
|
| 2019 | J | jnl |
J. Parallel Distributed Comput.
|
| 2019 | B | conf |
SIROCCO
|
| 2019 | J | jnl |
CoRR
|
| 2019 | — | book |
|
| 2019 | J | jnl |
Computing
|
| 2019 | A | conf |
ICDCS
|
| 2019 | J | jnl |
CoRR
|
| 2019 | Misc | conf |
ICDCN
|
| 2019 | C | conf |
FORTE
|
| 2018 | J | jnl |
CoRR
|
| 2018 | C | conf |
SSS
|
| 2017 | J | jnl |
Log. Methods Comput. Sci.
|
| 2017 | B | conf |
WiMob
|
| 2017 | J | jnl |
J. Parallel Distributed Comput.
|
| 2017 | A | conf |
IPDPS
|
| 2017 | J | jnl |
Theor. Comput. Sci.
|
| 2017 | J | jnl |
Wirel. Networks
|
| 2017 | J | jnl |
CoRR
|
| 2017 | J | jnl |
Discret. Math. Theor. Comput. Sci.
|
| 2017 | J | jnl |
Parallel Process. Lett.
|
| 2017 | J | jnl |
Inf. Comput.
|
| 2017 | J | jnl |
Theor. Comput. Sci.
|
| 2016 | C | conf |
FORTE
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
Theor. Comput. Sci.
|
| 2016 | — | conf |
Euro-Par
|
| 2016 | C | conf |
SSS
|
| 2016 | B | conf |
OPODIS
|
| 2016 | J | jnl |
J. Parallel Distributed Comput.
|
| 2016 | J | jnl |
J. Parallel Distributed Comput.
|
| 2016 | J | jnl |
Theor. Comput. Sci.
|
| 2015 | — | conf |
NETYS
|
| 2015 | — | conf |
NETYS
|
| 2015 | Misc | conf |
ICDCN
|
| 2015 | J | jnl |
J. Parallel Distributed Comput.
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Int. J. Found. Comput. Sci.
|
| 2014 | J | jnl |
Discret. Appl. Math.
|
| 2014 | Misc | conf |
ICDCN
|
| 2014 | C | conf |
SSS
|
| 2013 | J | jnl |
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks.
J. Comb. Optim.
|
| 2013 | Misc | conf |
ICDCN
|
| 2013 | — | conf |
IPDPS Workshops
|
| 2013 | J | jnl |
Theor. Comput. Sci.
|
| 2013 | J | jnl |
Theor. Comput. Sci.
|
| 2013 | B | conf |
DCOSS
|
| 2013 | J | jnl |
Int. J. Netw. Comput.
|
| 2013 | C | conf |
SSS
|
| 2013 | Misc | conf |
ICDCN
|
| 2013 | J | jnl |
Theor. Comput. Sci.
|
| 2012 | J | jnl |
Tech. Sci. Informatiques
|
| 2012 | B | conf |
SIROCCO
|
| 2012 | C | conf |
SSS
|
| 2012 | A | conf |
ICDCS
|
| 2012 | Misc | ed. |
ICDCN
|
| 2012 | — | conf |
TADDS
|
| 2012 | C | conf |
SSS
|
| 2011 | J | jnl |
Int. J. Found. Comput. Sci.
|
| 2011 | J | jnl |
Tech. Sci. Informatiques
|
| 2011 | J | jnl |
Tech. Sci. Informatiques
|
| 2011 | C | conf |
SSS
|
| 2011 | Misc | conf |
ICNC
|
| 2011 | J | jnl |
CoRR
|
| 2011 | Misc | conf |
ICNC
|
| 2011 | J | jnl |
Int. J. Found. Comput. Sci.
|
| 2011 | C | conf |
SSS
|
| 2011 | A | conf |
IPDPS
|
| 2011 | Misc | conf |
ICNC
|
| 2010 | Misc | conf |
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks.
COCOON
|
| 2010 | J | jnl |
CoRR
|
| 2010 | B | conf |
SIROCCO
|
| 2010 | C | conf |
SSS
|
| 2010 | — | conf |
WRAS
|
| 2010 | Misc | conf |
ICDCN
|
| 2010 | J | jnl |
J. Parallel Distributed Comput.
|
| 2010 | J | jnl |
J. Parallel Distributed Comput.
|
| 2009 | B | conf |
SRDS
|
| 2009 | A | conf |
ICDCS
|
| 2009 | J | jnl |
ACM Trans. Auton. Adapt. Syst.
|
| 2009 | J | jnl |
CoRR
|
| 2009 | B | conf |
SIROCCO
|
| 2009 | A | conf |
IPDPS
|
| 2009 | A | conf |
IPDPS
|
| 2009 | Misc | conf |
ICDCN
|
| 2009 | C | conf |
PDCAT
|
| 2008 | J | jnl |
CoRR
|
| 2008 | J | jnl |
CoRR
|
| 2008 | J | jnl |
CoRR
|
| 2008 | J | jnl |
CoRR
|
| 2008 | A* | conf |
PODC
|
| 2008 | A | conf |
ICDCS
|
| 2008 | B | conf |
OPODIS
|
| 2007 | C | conf |
SSS
|
| 2007 | J | jnl |
CoRR
|
| 2006 | C | conf |
SSS
|
| 2006 | — | — |
|
| 2006 | J | jnl |
Comput. J.
|
| 2006 | — | conf |
ICPADS (1)
|
| 2005 | J | jnl |
Parallel Process. Lett.
|
| 2005 | — | conf |
Self-Stabilizing Systems
|
| 2005 | Misc | conf |
HiPC
|
| 2004 | B | conf |
OPODIS
|