default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnegret Wagler
Annegret Katrin Wagler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j85]José Luis Figueroa González
, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. Discret. Appl. Math. 356: 350-368 (2024)- [j84]Victoria Kaial, Hervé Kerivin, Annegret Katrin Wagler:
On non-superperfection of edge intersection graphs of paths. Discret. Optim. 54: 100857 (2024) - [j83]Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347(12): 114176 (2024) - [j82]Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler:
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191(3-4): 197-229 (2024) - [j81]Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler:
Solving the routing and spectrum assignment problem, driven by combinatorial properties. Networks 83(2): 390-407 (2024) - 2023
- [j80]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Katrin Wagler:
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. Discret. Appl. Math. 332: 70-86 (2023) - [j79]José Luis Figueroa, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers. SN Comput. Sci. 4(1): 79 (2023) - 2022
- [j78]Annegret Katrin Wagler:
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. Discret. Appl. Math. 308: 209-219 (2022) - [j77]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. Discret. Appl. Math. 322: 465-480 (2022) - 2021
- [j76]Arnaud Pêcher, Annegret Katrin Wagler:
On circular-perfect graphs: A survey. Eur. J. Comb. 91: 103224 (2021) - 2020
- [j75]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Linear-time algorithms for three domination-based separation problems in block graphs. Discret. Appl. Math. 281: 6-41 (2020) - [j74]Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, Annegret Katrin Wagler:
On some graph classes related to perfect graphs: A survey. Discret. Appl. Math. 281: 42-60 (2020) - 2019
- [j73]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet management for autonomous vehicles: Online PDP under special constraints. RAIRO Oper. Res. 53(3): 1007-1031 (2019) - 2018
- [j72]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Polyhedra associated with identifying codes in graphs. Discret. Appl. Math. 245: 16-27 (2018) - [j71]Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler:
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. Electron. Notes Discret. Math. 69: 85-92 (2018) - [j70]Anne Berry, Annegret Wagler:
The Normal Graph Conjecture for Two Classes of Sparse Graphs. Graphs Comb. 34(1): 139-157 (2018) - 2017
- [j69]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
A linear-time algorithm for the identifying code problem on block graphs. Electron. Notes Discret. Math. 62: 249-254 (2017) - [j68]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet management for autonomous vehicles using flows in time-expanded networks. Electron. Notes Discret. Math. 62: 255-260 (2017) - [j67]Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Characterizing N+-perfect line graphs. Int. Trans. Oper. Res. 24(1-2): 325-337 (2017) - 2016
- [j66]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Progress on the description of identifying code polyhedra for some families of split graphs. Discret. Optim. 22: 225-240 (2016) - 2015
- [j65]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Discret. Appl. Math. 186: 19-44 (2015) - [j64]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
A polyhedral approach to locating-dominating sets in graphs. Electron. Notes Discret. Math. 50: 89-94 (2015) - [j63]Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
On the Online Min-Wait Relocation Problem. Electron. Notes Discret. Math. 50: 281-286 (2015) - 2014
- [j62]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Balancedness of subclasses of circular-arc graphs. Discret. Math. Theor. Comput. Sci. 16(3): 1-22 (2014) - [j61]Arnaud Pêcher, Annegret Wagler:
Computing the clique number of aa-perfect graphs in polynomial time. Eur. J. Comb. 35: 449-458 (2014) - [j60]Annegret Katrin Wagler, Jan-Thierry Wegener:
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility. Fundam. Informaticae 135(4): 521-535 (2014) - [j59]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness and balancedness of some graph classes. Int. J. Comput. Math. 91(10): 2118-2141 (2014) - [j58]Annegret Wagler:
Automatic network reconstruction from experimental time-series data: A survey. it Inf. Technol. 56(2): 46-54 (2014) - 2013
- [j57]Balamurali Sreedhar, Annegret Wagler, Malte Kaspereit, Andreas Seidel-Morgenstern:
Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms. Comput. Chem. Eng. 49: 158-169 (2013) - [j56]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
On minimal forbidden subgraph characterizations of balanced graphs. Discret. Appl. Math. 161(13-14): 1925-1942 (2013) - [j55]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
Polyhedra associated with identifying codes. Electron. Notes Discret. Math. 44: 175-180 (2013) - [j54]Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Models and Algorithms for Carsharing Systems and Related Problems. Electron. Notes Discret. Math. 44: 201-206 (2013) - [j53]Annegret Katrin Wagler, Jan-Thierry Wegener:
On Minimality and Equivalence of Petri Nets. Fundam. Informaticae 128(1-2): 209-222 (2013) - [j52]Arnaud Pêcher, Annegret Katrin Wagler:
Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program. 141(1-2): 121-133 (2013) - [j51]Luis Miguel Torres, Annegret Katrin Wagler:
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view. RAIRO Oper. Res. 47(3): 321-330 (2013) - 2012
- [j50]Arnaud Pêcher, Annegret Katrin Wagler:
Polynomial time computability of some graph parameters for superclasses of perfect graphs. Int. J. Math. Oper. Res. 4(3): 263-275 (2012) - 2011
- [j49]Markus Durzinsky, Annegret Wagler, Wolfgang Marwan:
Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks. BMC Syst. Biol. 5: 113 (2011) - [j48]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Electron. Notes Discret. Math. 37: 327-332 (2011) - [j47]Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler:
A lower bound on the Chvátal-rank of Antiwebs. Electron. Notes Discret. Math. 37: 381-386 (2011) - [j46]Arnaud Pêcher, Annegret Katrin Wagler:
Computing the clique number of a-perfect graphs in polynomial time. Electron. Notes Discret. Math. 38: 705-710 (2011) - [j45]Luis Miguel Torres, Annegret Katrin Wagler:
Encoding the dynamics of deterministic systems. Math. Methods Oper. Res. 73(3): 281-300 (2011) - [j44]Wolfgang Marwan, Annegret Wagler, Robert Weismantel:
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks. Nat. Comput. 10(2): 639-654 (2011) - [j43]Annegret Wagler, Robert Weismantel:
The combinatorics of modeling and analyzing biological systems. Nat. Comput. 10(2): 655-681 (2011) - [j42]Markus Durzinsky, Annegret Wagler, Robert Weismantel:
An algorithmic framework for network reconstruction. Theor. Comput. Sci. 412(26): 2800-2815 (2011) - [j41]Markus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub, Annegret Wagler:
Automatic network reconstruction using ASP. Theory Pract. Log. Program. 11(4-5): 749-766 (2011) - 2010
- [j40]Arnaud Pêcher, Annegret Katrin Wagler:
On facets of stable set polytopes of claw-free graphs with stability number 3. Discret. Math. 310(3): 493-498 (2010) - [j39]Luis Miguel Torres, Annegret Katrin Wagler:
Model reconstruction for discrete deterministic systems. Electron. Notes Discret. Math. 36: 175-182 (2010) - [j38]Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler:
On the Chvátal-rank of Antiwebs. Electron. Notes Discret. Math. 36: 183-190 (2010) - [j37]Arnaud Pêcher, Annegret Katrin Wagler:
Clique and chromatic number of circular-perfect graphs. Electron. Notes Discret. Math. 36: 199-206 (2010) - [j36]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Balancedness of some subclasses of circular-arc graphs. Electron. Notes Discret. Math. 36: 1121-1128 (2010) - [j35]Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler:
On the Chvátal rank of linear relaxations of the stable set polytope. Int. Trans. Oper. Res. 17(6): 827-849 (2010) - 2009
- [j34]Javier Marenco, Annegret Wagler:
Cycle-based facets of chromatic scheduling polytopes. Discret. Optim. 6(1): 51-63 (2009) - [j33]Javier Marenco, Annegret Wagler:
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques. Discret. Optim. 6(1): 64-78 (2009) - [j32]Sylvain Coulonges, Arnaud Pêcher, Annegret Katrin Wagler:
Triangle-free strongly circular-perfect graphs. Discret. Math. 309(11): 3632-3643 (2009) - [j31]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
On minimal forbidden subgraph characterizations of balanced graphs. Electron. Notes Discret. Math. 35: 41-46 (2009) - [j30]Arnaud Pêcher, Annegret Katrin Wagler:
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. Electron. Notes Discret. Math. 35: 53-58 (2009) - [j29]Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler:
Characterizing and bounding the imperfection ratio for some classes of graphs. Math. Program. 118(1): 37-46 (2009) - 2008
- [j28]Markus Durzinsky, Annegret Wagler, Robert Weismantel, Wolfgang Marwan:
Automatic reconstruction of molecular and genetic networks from discrete time series data. Biosyst. 93(3): 181-190 (2008) - [j27]Arnaud Pêcher, Annegret Wagler:
On classes of minimal circular-imperfect graphs. Discret. Appl. Math. 156(7): 998-1010 (2008) - [j26]Annegret Wagler:
Constructions for normal graphs and some consequences. Discret. Appl. Math. 156(17): 3329-3338 (2008) - [j25]Wolfgang Marwan, Annegret Wagler, Robert Weismantel:
A mathematical approach to solve the network reconstruction problem. Math. Methods Oper. Res. 67(1): 117-132 (2008) - [j24]Arie M. C. A. Koster, Annegret Katrin Wagler:
Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO Oper. Res. 42(4): 485-500 (2008) - 2007
- [j23]Javier Marenco, Annegret Wagler:
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems. Ann. Oper. Res. 150(1): 159-175 (2007) - [j22]Arnaud Pêcher, Pierre Pesneau, Annegret Wagler:
On facets of stable set polytopes of claw-free graphs with stability number three. Electron. Notes Discret. Math. 28: 185-190 (2007) - [j21]Jens Kuhpfahl, Annegret Katrin Wagler, Christian Wagner:
Circular-imperfection of triangle-free graphs. Electron. Notes Discret. Math. 29: 163-167 (2007) - [j20]Arnaud Pêcher, Annegret Wagler:
A note on the Chvátal-rank of clique family inequalities. RAIRO Oper. Res. 41(3): 289-294 (2007) - 2006
- [j19]Arnaud Pêcher, Annegret Wagler:
On non-rank facets of stable set polytopes of webs with clique number four. Discret. Appl. Math. 154(9): 1408-1415 (2006) - [j18]Javier Marenco, Annegret Wagler:
On the combinatorial structure of chromatic scheduling polytopes. Discret. Appl. Math. 154(13): 1865-1876 (2006) - [j17]Arnaud Pêcher, Annegret Wagler:
A construction for non-rank facets of stable set polytopes of webs. Eur. J. Comb. 27(7): 1172-1185 (2006) - [j16]Arnaud Pêcher, Annegret Wagler:
Generalized clique family inequalities for claw-free graphs. Electron. Notes Discret. Math. 25: 117-121 (2006) - [j15]Arie M. C. A. Koster, Annegret Wagler:
On determining the imperfection ratio. Electron. Notes Discret. Math. 25: 177-181 (2006) - [j14]Arnaud Pêcher, Annegret Wagler:
Almost all webs are not rank-perfect. Math. Program. 105(2-3): 311-328 (2006) - 2005
- [j13]Annegret Wagler:
On rank-perfect subclasses of near-bipartite graphs. 4OR 3(4): 329-336 (2005) - [j12]Arnaud Pêcher, Annegret Wagler, Xuding Zhu:
Three classes of minimal circular-imperfect graphs. Electron. Notes Discret. Math. 19: 9-15 (2005) - [j11]Javier Marenco, Annegret Wagler:
The combinatorial stages of chromatic scheduling polytopes. Electron. Notes Discret. Math. 19: 63-69 (2005) - [j10]Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler:
On strongly circular-perfectness. Electron. Notes Discret. Math. 22: 369-374 (2005) - 2004
- [j9]Annegret Wagler:
Antiwebs are rank-perfect. 4OR 2(2): 149-152 (2004) - [j8]Javier Marenco, Annegret Wagler:
Combinatorial equivalence of Chromatic Scheduling Polytopes. Electron. Notes Discret. Math. 18: 177-180 (2004) - [j7]Stefan Hougardy, Annegret Wagler:
Perfectness is an Elusive Graph Property. SIAM J. Comput. 34(1): 109-117 (2004) - 2003
- [j6]Arnaud Pêcher, Annegret Wagler:
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. Electron. Notes Discret. Math. 13: 93-96 (2003) - 2002
- [j5]Annegret Katrin Wagler:
Rank-perfect and" weakly rank-perfect graphs. Math. Methods Oper. Res. 56(1): 127-149 (2002) - 2001
- [j4]Zsolt Tuza, Annegret Wagler:
Minimally Non-Preperfect Graphs of Small Maximum Degree. Graphs Comb. 17(4): 759-773 (2001) - 1999
- [j3]Annegret Wagler:
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. Discret. Appl. Math. 95(1-3): 455-466 (1999) - [j2]Annegret Wagler:
On critically perfect graphs. J. Graph Theory 32(4): 394-404 (1999) - 1997
- [j1]Stefan Hougardy, Van Bang Le, Annegret Wagler:
Wing-triangulated graphs are perfect. J. Graph Theory 24(1): 25-31 (1997)
Conference and Workshop Papers
- 2024
- [c29]Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. CALDAM 2024: 255-269 - [c28]Dipayan Chakraborty, Annegret Katrin Wagler:
Open-Separating Dominating Codes in Graphs. ISCO 2024: 137-151 - 2023
- [c27]Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. CALDAM 2023: 271-283 - [c26]José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Managing Time Expanded Networks through Project and Lift: the Lift Issue. LAGOS 2023: 241-249 - [c25]Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler:
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). LAGOS 2023: 391-393 - [c24]José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Managing a Time Expanded Network through Project-and-Lift. SoICT 2023: 687-694 - 2022
- [c23]José L. Figueroa, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon. ICORES 2022: 17-27 - [c22]Pedro Henrique Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret Wagler:
A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. INOC 2022: 1-6 - [c21]José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. ISCO 2022: 22-34 - 2020
- [c20]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. ISCO 2020: 3-14 - 2019
- [c19]Youssouf Hadhbi, Hervé Kerivin, Annegret Wagler:
A novel integer linear programming model for routing and spectrum assignment in optical networks. FedCSIS 2019: 127-134 - [c18]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. LAGOS 2019: 135-145 - 2018
- [c17]Annegret Wagler:
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. ISCO 2018: 416-427 - [c16]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. SEA 2018: 25:1-25:14 - 2016
- [c15]Luis Miguel Torres, Annegret Katrin Wagler:
Analyzing the dynamics of discrete deterministic systems. CoDIT 2016: 382-387 - [c14]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. ISCO 2016: 59-70 - 2015
- [c13]Luis Miguel Torres, Annegret Katrin Wagler:
The dynamics of deterministic systems - A survey. BioPPN@Petri Nets 2015: 1-20 - 2014
- [c12]Marie C. F. Favre, Wolfgang Marwan, Annegret Wagler:
Integrating a priori knowledge in automatic network reconstruction. BioPPN@Petri Nets 2014: 45-59 - [c11]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Study of Identifying Code Polyhedra for Some Families of Split Graphs. ISCO 2014: 13-25 - [c10]Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. SEA 2014: 87-98 - 2013
- [c9]Marie C. F. Favre, Annegret Wagler:
Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'. BioPPN@Petri Nets 2013: 45-59 - [c8]Annegret Katrin Wagler, Jan-Thierry Wegener:
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility. CS&P 2013: 434-447 - [c7]Anne Berry, Annegret Wagler:
The Normal Graph Conjecture for Classes of Sparse Graphs. WG 2013: 64-75 - 2012
- [c6]Annegret Wagler, Jan-Thierry Wegener:
On Minimality and Equivalence of Petri Nets. CS&P 2012: 382-393 - [c5]Anne Berry, Annegret Wagler:
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG 2012: 7-21 - 2011
- [c4]Gabriela R. Argiroffo, Annegret Wagler:
Generalized row family inequalities for the set covering polyhedron. CTW 2011: 60-63 - [c3]Luis Miguel Torres, Annegret Katrin Wagler:
The dynamics of deterministic systems from a hypergraph theoretical point of view. CTW 2011: 259-262 - 2008
- [c2]Markus Durzinsky, Annegret Wagler, Robert Weismantel:
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. CMSB 2008: 328-346 - 2001
- [c1]Annegret Wagler:
Critical and Anticritical Edges in Perfect Graphs. WG 2001: 317-328
Parts in Books or Collections
- 2016
- [p3]Annegret Wagler:
Prediction of Network Structure. Modeling in Systems Biology, The Petri Net Approach 2016: 307-336 - 2014
- [p2]Annegret Katrin Wagler:
Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow. Large-Scale Networks in Engineering and Life Sciences 2014: 225-262 - 2004
- [p1]Annegret Katrin Wagler:
Relaxing Perfectness: Which Graphs Are "Almost" Perfect? The Sharpest Cut 2004: 77-96
Editorship
- 2015
- [e1]Monika Heiner, Annegret Katrin Wagler:
Proceedings of the 6th International Workshop on Biological Processes & Petri Nets co-located with 36th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2015), Brussels, Belgium, June 22, 2015. CEUR Workshop Proceedings 1373, CEUR-WS.org 2015 [contents]
Informal and Other Publications
- 2024
- [i12]Dipayan Chakraborty, Annegret Katrin Wagler:
Open-separating dominating codes in graphs. CoRR abs/2402.03015 (2024) - [i11]Dipayan Chakraborty, Annegret Katrin Wagler:
On full-separating sets in graphs. CoRR abs/2407.10595 (2024) - 2022
- [i10]Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR abs/2211.14178 (2022) - 2018
- [i9]Aline Parreau, Annegret Katrin Wagler:
On three domination numbers in block graphs. CoRR abs/1811.09537 (2018) - 2017
- [i8]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet management for autonomous vehicles: Online PDP under special constraints. CoRR abs/1703.10565 (2017) - 2016
- [i7]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet management for autonomous vehicles. CoRR abs/1609.01634 (2016) - 2015
- [i6]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Locating-dominating sets in some families of split graphs. CTW 2015: 32-35 - [i5]Sahar Bsaybes, Alain Quilliot, Annegret Wagler:
Fleet management of autonomous vehicles: VIPAFLEET. CTW 2015: 173-176 - [i4]Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret Wagler:
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. CoRR abs/1509.02485 (2015) - [i3]Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems. CoRR abs/1511.02650 (2015) - [i2]Sahar Bsaybes, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem. CoRR abs/1511.02751 (2015) - 2011
- [i1]Max Ostrowski, Torsten Schaub, Markus Durzinsky, Wolfgang Marwan, Annegret Wagler:
Automatic Network Reconstruction using ASP. CoRR abs/1107.5671 (2011)
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-09-10 02:11 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:
