default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarim Nouioua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j9]Nicolas Catusse, Victor Chepoi
, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017)- 2012
- [j8]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) - 2011
- [j7]Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua:
LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3): 299-316 (2011) - [c4]Frédéric Gardi, Karim Nouioua:
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. EvoCOP 2011: 167-178 - [i2]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011) - 2010
- [j6]Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès:
Pareto Envelopes in Simple Polygons. Int. J. Comput. Geom. Appl. 20(6): 707-721 (2010) - [i1]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. CoRR abs/1004.5517 (2010)
2000 – 2009
- 2009
- [c3]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS 2009: 1-15 - 2008
- [j5]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3): 928-944 (2008) - [j4]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008) - 2007
- [c2]Victor Chepoi, Karim Nouioua:
Pareto envelopes in R3 under l1 and linfinity distance functions. SCG 2007: 284-293 - 2006
- [j3]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) - [j2]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Large neighborhood improvements for solving car sequencing problems. RAIRO Oper. Res. 40(4): 355-379 (2006) - 2005
- [j1]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints. Electron. Notes Discret. Math. 22: 405-408 (2005) - [c1]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51
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-25 05:45 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:
