| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles.
J. Comput. Syst. Sci.
|
| 2026 | J | jnl |
Discret. Appl. Math.
|
| 2025 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Theory Comput. Syst.
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Algorithmica
|
| 2024 | — | conf |
COCOON (1)
|
| 2024 | J | jnl |
CoRR
|
| 2023 | B | conf |
WG
|
| 2023 | J | jnl |
CoRR
|
| 2022 | B | conf |
MFCS
|
| 2022 | J | jnl |
CoRR
|
| 2021 | J | jnl |
Algorithmica
|
| 2019 | J | jnl |
Theor. Comput. Sci.
|
| 2019 | B | conf |
MFCS
|
| 2019 | J | jnl |
Algorithmica
|
| 2019 | J | jnl |
Theor. Comput. Sci.
|
| 2019 | Misc | conf |
COCOON
|
| 2018 | J | jnl |
CoRR
|
| 2018 | J | jnl |
CoRR
|
| 2018 | J | jnl |
CoRR
|
| 2017 | Misc | conf |
COCOON
|
| 2016 | B | conf |
ISAAC
|
| 2007 | J | jnl |
Algorithmica
|
| 2006 | J | jnl |
Theory Comput. Syst.
|
| 2005 | J | jnl |
Discret. Appl. Math.
|
| 2005 | B | conf |
FCT
|
| 2005 | J | jnl |
Theory Comput. Syst.
|
| 2004 | — | — |
|
| 2004 | J | jnl |
Int. J. Found. Comput. Sci.
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2003 | J | jnl |
Discret. Appl. Math.
|
| 2003 | J | jnl |
Inf. Process. Lett.
|
| 2003 | B | conf |
WG
|
| 2002 | B | conf |
WG
|
| 2002 | J | jnl |
Inf. Process. Lett.
|
| 2002 | J | jnl |
Inf. Process. Lett.
|
| 2002 | B | conf |
ISAAC
|
| 1999 | J | jnl |
Networks
|