default search action
Mengchuan Zou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Michel Habib, Lalla Mouatadid
, Éric Sopena, Mengchuan Zou:
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. SIAM J. Discret. Math. 38(1): 566-589 (2024) - [c9]Peng Lin, Mengchuan Zou, Shaowei Cai:
An Efficient Local Search Solver for Mixed Integer Programming. CP 2024: 19:1-19:19 - [c8]Peng Lin, Mengchuan Zou, Zhihan Chen, Shaowei Cai:
ParaILP: A Parallel Local Search Framework for Integer Linear Programming with Cooperative Evolution Mechanism. IJCAI 2024: 6949-6957 - [c7]Xiang He
An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear Constraints. KDD 2024: 1040-1049 - 2023
- [c6]Hongduo Liu, Peiyu Liao, Mengchuan Zou, Bowen Pang, Xijun Li, Mingxuan Yuan, Tsung-Yi Ho, Bei Yu:
Layout Decomposition via Boolean Satisfiability. DAC 2023: 1-6 - [i3]Peng Lin, Shaowei Cai, Mengchuan Zou, Jinkun Lin:
Local Search for Integer Linear Programming. CoRR abs/2305.00188 (2023) - 2022
- [j1]Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923: 56-73 (2022) - 2021
- [i2]Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
(α, β)-Modules in Graphs. CoRR abs/2101.08881 (2021) - 2020
- [c5]Michel Habib, Lalla Mouatadid, Mengchuan Zou:
Approximating Modular Decomposition Is Hard. CALDAM 2020: 53-66
2010 – 2019
- 2019
- [b1]Mengchuan Zou:
Aspects de l'efficacité dans des problèmes sélectionnés pour des calculs sur les graphes de grande taille. (Aspects of Efficiency in Selected Problems of Computation on Large Graphs). Paris Diderot University, France, 2019 - [c4]Michel Habib
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA 2019: 251-264 - 2017
- [c3]Dariusz Dereniowski
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP 2017: 84:1-84:14 - [i1]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR abs/1702.08207 (2017) - 2016
- [c2]Mengchuan Zou, Jialiang Lu, Fan Yang, Mathilde Malaspina, Fabrice Theoleyre
Distributed Scheduling of Enhanced Beacons for IEEE802.15.4-TSCH Body Area Networks. ADHOC-NOW 2016: 3-16 - 2014
- [c1]Oana Iova, Fabrice Theoleyre
Efficient and reliable MAC-layer broadcast for IEEE 802.15.4 Wireless Sensor Networks. WMNC 2014: 1-8
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-11-18 20:44 CET 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: