default search action
Marcelo Fonseca Faraj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. SEA 2024: 5:1-5:21 - [c11]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. SEA 2024: 11:1-11:22 - [i13]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. CoRR abs/2402.07753 (2024) - [i12]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. CoRR abs/2402.11980 (2024) - 2023
- [b1]Marcelo Fonseca Faraj:
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition. University of Heidelberg, Germany, 2023 - [j3]Ümit V. Çatalyürek
, Karen D. Devine
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55(12): 253:1-253:38 (2023) - [c10]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. ALENEX 2023: 96-109 - [c9]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. ESA 2023: 34:1-34:16 - [c8]Felix Hausberger
A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering. GECCO Companion 2023: 207-210 - [c7]Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. SEA 2023: 15:1-15:16 - [i11]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. CoRR abs/2301.07145 (2023) - [i10]Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. CoRR abs/2302.06259 (2023) - [i9]Marcelo Fonseca Faraj:
Streaming, Local, and Multi-Level (Hyper)Graph Decomposition. CoRR abs/2308.15617 (2023) - [i8]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i7]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j2]Marcelo Fonseca Faraj
Buffered Streaming Graph Partitioning. ACM J. Exp. Algorithmics 27: 1.10:1-1.10:26 (2022) - [c6]Marcelo Fonseca Faraj, Christian Schulz:
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping. CLUSTER 2022: 473-483 - [c5]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. SOCS 2022: 261-263 - [i6]Marcelo Fonseca Faraj, Christian Schulz:
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping. CoRR abs/2202.00394 (2022) - [i5]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. CoRR abs/2205.06176 (2022) - [i4]Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner:
More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022) - [i3]Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz:
A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering. CoRR abs/2208.13618 (2022) - 2021
- [i2]Marcelo Fonseca Faraj, Christian Schulz:
Buffered Streaming Graph Partitioning. CoRR abs/2102.09384 (2021) - 2020
- [j1]Marcelo Fonseca Faraj, Sebastián Urrutia, João F. Machry Sarubbi:
Gamma deployment problem in grids: hardness and new integer linear programming formulation. Int. Trans. Oper. Res. 27(6): 2740-2759 (2020) - [c4]Marcelo Fonseca Faraj
High-Quality Hierarchical Process Mapping. SEA 2020: 4:1-4:15 - [i1]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. CoRR abs/2001.07134 (2020)
2010 – 2019
- 2018
- [c3]Marcelo Fonseca Faraj, João F. M. Sarubbi, Cristiano M. Silva, Flávio V. C. Martins:
A Memetic Algorithm Approach to Deploy RSU s Based on the Gamma Deployment Metric. CEC 2018: 1-8 - 2017
- [c2]Marcelo Fonseca Faraj, João Fernando Machry Sarubbi, Cristiano Maciel da Silva, Flávio Vinícius Cruzeiro Martins:
A hybrid genetic algorithm for deploying RSUs in VANETs based on inter-contact time. GECCO (Companion) 2017: 193-194 - 2014
- [c1]Marcelo Fonseca Faraj, João Fernando Machry Sarubbi, Cristiano M. Silva, Marcelo Franco Porto, Nilson Tadeu Ramos Nunes:
A real geographical application for the School Bus Routing Problem. ITSC 2014: 2762-2767
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-10-07 22:08 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: