default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsuzsanna Róka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Patrick Healy
, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312(1): 117-124 (2024)- 2021
- [j6]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Tire noise optimization problem: a mixed integer linear programming approach. RAIRO Oper. Res. 55(5): 3073-3085 (2021) - 2020
- [j5]Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka:
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discret. Optim. 35: 100551 (2020) - [c8]Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Exact and Heuristic Solutions to the Connected k-Partitioning Problem. CoDIT 2020: 1127-1132
2010 – 2019
- 2018
- [i1]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach. CoRR abs/1809.05058 (2018) - 2017
- [c7]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. CoDIT 2017: 6-11 - 2016
- [c6]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Optimization of tire noise by solving an Integer Linear Program (ILP). SMC 2016: 1591-1596 - 2014
- [c5]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. CoDIT 2014: 182-187
2000 – 2009
- 2003
- [j4]Bruno Durand, Enrico Formenti, Zsuzsanna Róka:
Number-conserving cellular automata I: decidability. Theor. Comput. Sci. 299(1-3): 523-535 (2003) - [c4]Bruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka:
Number conserving cellular automata: new results on decidability and dynamics. DMCS 2003: 129-140 - 2000
- [j3]Zsuzsanna Róka:
The firing squad synchronization problem on Cayley graphs. Theor. Comput. Sci. 244(1-2): 243-256 (2000)
1990 – 1999
- 1999
- [j2]Zsuzsanna Róka:
Simulations between Cellular Automata on Cayley Graphs. Theor. Comput. Sci. 225(1-2): 81-111 (1999) - 1995
- [c3]Zsuzsanna Róka:
Simulations Between Cellular Automata on Cayley Graphs. LATIN 1995: 483-493 - [c2]Zsuzsanna Róka:
The Firing Squad Synchronization Problem on Cayley Graphs. MFCS 1995: 402-411 - 1994
- [j1]Zsuzsanna Róka:
One-Way Cellular Automata on Cayley Graphs. Theor. Comput. Sci. 132(2): 259-290 (1994) - 1993
- [c1]Zsuzsanna Róka:
One-way Cellular Automata on Cayley Graphs. FCT 1993: 406-417
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
