default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklós Molnár
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Basma Mostafa
, Miklós Molnár, Mohamed Mostafa Saleh, Abderrahim Benslimane, Sally S. Kassem:
Optimal proactive monitor placement & scheduling for IoT networks. J. Oper. Res. Soc. 73(11): 2431-2450 (2022)
2010 – 2019
- 2019
- [j23]Miklós Molnár, Dinh Danh Le, Jordi Perelló, Josep Solé-Pareta, Conor McArdle:
Multicast routing from a set of data centers in elastic optical networks. Opt. Switch. Netw. 34: 35-46 (2019) - 2018
- [j22]Walid Khallef, Sylvain Durand, Miklós Molnár:
ILP formulation of the exact solution of multi-constrained minimum cost multicast. Comput. Networks 135: 160-170 (2018) - [j21]Basma Mostafa, Abderrahim Benslimane, Mohamed Mostafa Saleh, Sally S. Kassem, Miklós Molnár:
An Energy-Efficient Multiobjective Scheduling Model for Monitoring in Internet of Things. IEEE Internet Things J. 5(3): 1727-1738 (2018) - [j20]Massinissa Merabet, Miklós Molnár, Sylvain Durand:
ILP formulation of the degree-constrained minimum spanning hierarchy problem. J. Comb. Optim. 36(3): 789-811 (2018) - [c29]Massinissa Merabet, Jitamitra Desai, Miklós Molnár:
A Generalization of the Minimum Branch Vertices Spanning Tree Problem. ISCO 2018: 338-351 - 2017
- [c28]Walid Khallef, Miklós Molnár, Abderrahim Benslimane, Sylvain Durand:
Multiple constrained QoS routing with RPL. ICC 2017: 1-6 - [c27]Miklós Molnár:
Non-elementary routes for multicasting in Transparent Optical Networks. ICTON 2017: 1-4 - [c26]Walid Khallef, Miklós Molnár, Abderrahim Benslimane, Sylvain Durand:
On the QoS routing with RPL. PEMWN 2017: 1-5 - 2016
- [c25]Basma Mostafa, Abderrahim Benslimane, E. Boureau, Miklós Molnár, Mohamed Mostafa Saleh:
Distributed monitoring in 6LoWPAN based Internet of Things. MoWNet 2016: 1-7 - 2015
- [j19]Dinh Danh Le, Fen Zhou, Miklós Molnár:
Minimizing Blocking Probability for the Multicast Routing and Wavelength Assignment Problem in WDM Networks: Exact Solutions and Heuristic Algorithms. JOCN 7(1): 36-48 (2015) - [c24]Dinh Danh Le, Fen Zhou, Miklós Molnár:
Light-hierarchy for provisioning multiple multicast requests in sparse splitting WDM networks. ICNC 2015: 847-852 - 2014
- [j18]Dinh Danh Le, Miklós Molnár, Jérôme Palaysi:
Multicast routing in WDM networks without splitters. IEEE Commun. Mag. 52(7): 158-167 (2014) - [c23]Miklós Molnár, Sylvain Durand, Massinissa Merabet:
Approximation of the Degree-Constrained Minimum Spanning Hierarchies. SIROCCO 2014: 96-107 - 2013
- [j17]Massinissa Merabet, Sylvain Durand, Miklós Molnár:
Exact solution for branch vertices constrained spanning problems. Electron. Notes Discret. Math. 41: 527-534 (2013) - [j16]Miklós Molnár, Gyula Simon, László Gönczy:
Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks. Int. J. Ad Hoc Ubiquitous Comput. 14(2): 109-122 (2013) - 2012
- [j15]Miklós Molnár, Alia Bellabas, Samer Lahoud:
The cost optimal solution of the multi-constrained multicast routing problem. Comput. Networks 56(13): 3136-3149 (2012) - [j14]Alia Bellabas, Samer Lahoud, Miklós Molnár:
Performance Evaluation of Efficient Solutions for the QoS Unicast Routing. J. Networks 7(1): 73-80 (2012) - 2011
- [j13]Fen Zhou, Miklós Molnár, Bernard Cousin:
All-optical multipoint-to-point routing in WDM mesh networks. Ann. des Télécommunications 66(1-2): 91-101 (2011) - [j12]Fen Zhou, Miklós Molnár, Bernard Cousin, Gwendal Simon:
Power Optimal Design of Multicast Light-Trees in WDM Networks. IEEE Commun. Lett. 15(11): 1240-1242 (2011) - [j11]Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao:
Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks. JOCN 3(4): 323-334 (2011) - 2010
- [j10]Hamza Drid, Bernard Cousin, Miklós Molnár, Samer Lahoud:
A survey of survivability in multi-domain optical networks. Comput. Commun. 33(8): 1005-1012 (2010) - [j9]Hamza Drid, Bernard Cousin, Miklós Molnár, Nasir Ghani:
Graph Partitioning for Survivability in Multi-Domain Optical Networks. IEEE Commun. Lett. 14(10): 978-980 (2010) - [j8]Hamza Drid, Samer Lahoud, Bernard Cousin, Miklós Molnár:
Survivability in multi-domain optical networks using p-cycles. Photonic Netw. Commun. 19(1): 81-89 (2010) - [j7]Fen Zhou, Miklós Molnár, Bernard Cousin:
Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. Photonic Netw. Commun. 20(1): 33-42 (2010) - [c22]Alia Bellabas, Samer Lahoud, Miklós Molnár:
Fast Heuristics for the QoS Multicast Routing Problem. GLOBECOM 2010: 1-6 - [c21]Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao:
Approximation Ratios of Multicast Light-Trees in WDM Networks. GLOBECOM 2010: 1-6 - [c20]Hamza Drid, Bernard Cousin, Miklós Molnár, Nasir Ghani:
Graph Partitioning for Survivability in Multi-Domain Optical Networks. ICC 2010: 1-5 - [c19]Fen Zhou, Miklós Molnár, Bernard Cousin:
Light-hierarchy: the optimal structure for multicast routing in WDM mesh networks. ISCC 2010: 611-616 - [c18]Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao:
Cost Bounds of Multicast Light-Trees in WDM Networks. Networking 2010: 339-350 - [i7]Fen Zhou, Miklós Molnár, Bernard Cousin:
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks? CoRR abs/1012.0016 (2010) - [i6]Fen Zhou, Miklós Molnár, Bernard Cousin:
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks. CoRR abs/1012.0017 (2010) - [i5]Fen Zhou, Miklós Molnár, Bernard Cousin:
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks. CoRR abs/1012.0027 (2010) - [i4]Fen Zhou, Miklós Molnár, Bernard Cousin:
Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. CoRR abs/1012.0037 (2010)
2000 – 2009
- 2009
- [j6]Anders Ekholm, Miklós Molnár:
ICT development strategies for industrialisation of the building sector. J. Inf. Technol. Constr. 14: 429-444 (2009) - [j5]Fen Zhou, Miklós Molnár, Bernard Cousin:
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks. Photonic Netw. Commun. 18(3): 378-392 (2009) - [j4]Hamza Drid, Bernard Cousin, Samer Lahoud, Miklós Molnár:
Protection par p-cycles dans les réseaux WDM. Tech. Sci. Informatiques 28(4): 459-478 (2009) - [c17]Fen Zhou, Miklós Molnár, Bernard Cousin:
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks? ICCCN 2009: 1-7 - [c16]Gilles Bertrand, Samer Lahoud, Géraldine Texier, Miklós Molnár:
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths. EUNICE 2009: 21-30 - [c15]Fen Zhou, Mohand Yazid Saidi, Miklós Molnár, Bernard Cousin:
Supporting multipoint-to-point communications in all-optical WDM networks. LCN 2009: 209-212 - [c14]Gilles Bertrand, Samer Lahoud, Géraldine Texier, Miklós Molnár:
Computation of Multi-Constrained Paths in Multi-Domain MPLS-TE Networks. NGI 2009: 1-8 - [c13]Hamza Drid, Samer Lahoud, Bernard Cousin, Miklós Molnár:
A Topology Aggregation Model for Survivability in Multi-Domain Optical Networks Using p-Cycles. NPC 2009: 211-218 - [i3]Fen Zhou, Miklós Molnár, Bernard Cousin:
Distance priority based multicast routing in WDM networks considering sparse light splitting. CoRR abs/0908.1471 (2009) - 2008
- [j3]Naouel Ben Ali, Abdelfattah Belghith, Joanna Moulierac, Miklós Molnár:
QoS multicast aggregation under multiple additive constraints. Comput. Commun. 31(15): 3564-3578 (2008) - [j2]Gyula Simon, Miklós Molnár, László Gönczy, Bernard Cousin:
Robust k-Coverage Algorithms for Sensor Networks. IEEE Trans. Instrum. Meas. 57(8): 1741-1748 (2008) - [c12]Hanen Idoudi, Abdelfattah Belghith, Miklós Molnár:
Trade-offs between Optimality and Validity in Probabilistic Routing for Mobile Multi-Hop Networks. Communications in Computing 2008: 166-172 - [c11]Abdelfattah Belghith, Hanen Idoudi, Miklós Molnár:
Proactive Probabilistic Routing in Mobile Ad-hoc Networks. ICWN 2008: 621-627 - [c10]Fen Zhou, Miklós Molnár, Bernard Cousin:
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks. LCN 2008: 336-344 - [c9]Hamza Drid, Bernard Cousin, Samer Lahoud, Miklós Molnár:
Multi-criteria p-cycle network design. LCN 2008: 361-366 - [c8]Adel Ben Mnaouer, Abdelfattah Belghith, Naouel Ben Ali, Miklós Molnár:
TabooQMR: A Taboo-based search algorithm improving Mamcra for multicast routing. LCN 2008: 547-549 - [c7]Miklós Molnár, Gyula Simon, László Gönczy:
Robustness and performance analysis of a dynamic sensor network scheduling algorithm. QSHINE 2008: 52 - 2007
- [c6]Naouel Ben Ali, Joanna Moulierac, Abdelfattah Belghith, Miklós Molnár:
mQMA: Multi-Constrained QoS Multicast Aggregation. GLOBECOM 2007: 1927-1932 - [c5]Raymond A. Marie, Miklós Molnár, Hanen Idoudi:
A simple automata based model for stable routing in dynamic ad hoc networks. PM2HW2N 2007: 72-79 - [i2]Hamza Drid, Bernard Cousin, Miklós Molnár:
Heuristic Solution to Protect Communications in WDM Networks using P-cycles. CoRR abs/0710.3917 (2007) - [i1]Gyula Simon, Miklós Molnár, László Gönczy, Bernard Cousin:
Dependable k-coverage algorithms for sensor networks. CoRR abs/0710.3918 (2007) - 2006
- [j1]Joanna Moulierac, Alexandre Guitton, Miklós Molnár:
Hierarchical Aggregation of Multicast Trees in Large Domains. J. Commun. 1(6): 33-44 (2006) - [c4]Joanna Moulierac, Alexandre Guitton, Miklós Molnár:
On the Number of MPLS LSPs using Multicast Tree Aggregation. GLOBECOM 2006 - [c3]Joanna Moulierac, Miklós Molnár:
Active Monitoring of Link Delays in Case of Asymmetric Routes. ICN/ICONS/MCL 2006: 90 - [c2]Joanna Moulierac, Alexandre Guitton, Miklós Molnár:
Multicast Tree Aggregation in Large Domains. Networking 2006: 691-702 - 2005
- [c1]Miklós Molnár, Alexandre Guitton, Bernard Cousin, Raymond A. Marie:
Efficient Protection of Many-to-One Communications. EDCC 2005: 363-378
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:57 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:
