Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, and Tobias Stamm. New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{berndt_et_al:LIPIcs.ISAAC.2023.13, author = {Berndt, Sebastian and Brinkop, Hauke and Jansen, Klaus and Mnich, Matthias and Stamm, Tobias}, title = {{New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.13}, URN = {urn:nbn:de:0030-drops-193155}, doi = {10.4230/LIPIcs.ISAAC.2023.13}, annote = {Keywords: Integer programming, scheduling algorithms, uniformly related machines, makespan minimization} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen. Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 18:1-18:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bergougnoux_et_al:LIPIcs.ESA.2023.18, author = {Bergougnoux, Benjamin and Chekan, Vera and Ganian, Robert and Kant\'{e}, Mamadou Moustapha and Mnich, Matthias and Oum, Sang-il and Pilipczuk, Micha{\l} and van Leeuwen, Erik Jan}, title = {{Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.18}, URN = {urn:nbn:de:0030-drops-186710}, doi = {10.4230/LIPIcs.ESA.2023.18}, annote = {Keywords: Parameterized complexity, shrubdepth, space complexity, algebraic methods} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Max Deppert, Matthias Kaul, and Matthias Mnich. A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 39:1-39:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{deppert_et_al:LIPIcs.ESA.2023.39, author = {Deppert, Max and Kaul, Matthias and Mnich, Matthias}, title = {{A (3/2 + \epsilon)-Approximation for Multiple TSP with a Variable Number of Depots}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.39}, URN = {urn:nbn:de:0030-drops-186925}, doi = {10.4230/LIPIcs.ESA.2023.39}, annote = {Keywords: Traveling salesperson problem, rural postperson problem, multiple TSP, vehicle routing} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Alexander Göke, Jochen Koenemann, Matthias Mnich, and Hao Sun. Hitting Weighted Even Cycles in Planar Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 25:1-25:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{goke_et_al:LIPIcs.APPROX/RANDOM.2021.25, author = {G\"{o}ke, Alexander and Koenemann, Jochen and Mnich, Matthias and Sun, Hao}, title = {{Hitting Weighted Even Cycles in Planar Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {25:1--25:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.25}, URN = {urn:nbn:de:0030-drops-147186}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.25}, annote = {Keywords: Even cycles, planar graphs, integrality gap} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath. Solving Packing Problems with Few Small Items Using Rainbow Matchings. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bannach_et_al:LIPIcs.MFCS.2020.11, author = {Bannach, Max and Berndt, Sebastian and Maack, Marten and Mnich, Matthias and Lassota, Alexandra and Rau, Malin and Skambath, Malte}, title = {{Solving Packing Problems with Few Small Items Using Rainbow Matchings}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.11}, URN = {urn:nbn:de:0030-drops-126816}, doi = {10.4230/LIPIcs.MFCS.2020.11}, annote = {Keywords: Bin Packing, Knapsack, matching, fixed-parameter tractable} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Rian Neogi, M. S. Ramanujan, Saket Saurabh, and Roohani Sharma. On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 75:1-75:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{neogi_et_al:LIPIcs.MFCS.2020.75, author = {Neogi, Rian and Ramanujan, M. S. and Saurabh, Saket and Sharma, Roohani}, title = {{On the Parameterized Complexity of Deletion to ℋ-Free Strong Components}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {75:1--75:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.75}, URN = {urn:nbn:de:0030-drops-127444}, doi = {10.4230/LIPIcs.MFCS.2020.75}, annote = {Keywords: Directed Cut Problems, Fixed-parameter Tractability, DFVS} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Alexander Göke, Dániel Marx, and Matthias Mnich. Hitting Long Directed Cycles Is Fixed-Parameter Tractable. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 59:1-59:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{goke_et_al:LIPIcs.ICALP.2020.59, author = {G\"{o}ke, Alexander and Marx, D\'{a}niel and Mnich, Matthias}, title = {{Hitting Long Directed Cycles Is Fixed-Parameter Tractable}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {59:1--59:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.59}, URN = {urn:nbn:de:0030-drops-124664}, doi = {10.4230/LIPIcs.ICALP.2020.59}, annote = {Keywords: Directed graphs, directed feedback vertex set, circumference} }
Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Alexander Göke, Lydia Mirabel Mendoza Cadena, and Matthias Mnich. Resolving Infeasibility of Linear Systems: A Parameterized Approach. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 17:1-17:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{goke_et_al:LIPIcs.IPEC.2019.17, author = {G\"{o}ke, Alexander and Mendoza Cadena, Lydia Mirabel and Mnich, Matthias}, title = {{Resolving Infeasibility of Linear Systems: A Parameterized Approach}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-129-0}, ISSN = {1868-8969}, year = {2019}, volume = {148}, editor = {Jansen, Bart M. P. and Telle, Jan Arne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.17}, URN = {urn:nbn:de:0030-drops-114787}, doi = {10.4230/LIPIcs.IPEC.2019.17}, annote = {Keywords: Infeasible subsystems, linear programming, fixed-parameter algorithms} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Anna Adamaszek, Matthias Mnich, and Katarzyna Paluch. New Approximation Algorithms for (1,2)-TSP. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{adamaszek_et_al:LIPIcs.ICALP.2018.9, author = {Adamaszek, Anna and Mnich, Matthias and Paluch, Katarzyna}, title = {{New Approximation Algorithms for (1,2)-TSP}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.9}, URN = {urn:nbn:de:0030-drops-90133}, doi = {10.4230/LIPIcs.ICALP.2018.9}, annote = {Keywords: Approximation algorithms, traveling salesperson problem, cycle cover} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani. Reachability Switching Games. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 124:1-124:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fearnley_et_al:LIPIcs.ICALP.2018.124, author = {Fearnley, John and Gairing, Martin and Mnich, Matthias and Savani, Rahul}, title = {{Reachability Switching Games}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {124:1--124:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.124}, URN = {urn:nbn:de:0030-drops-91282}, doi = {10.4230/LIPIcs.ICALP.2018.124}, annote = {Keywords: Deterministic Random Walks, Model Checking, Reachability, Simple Stochastic Game, Switching Systems} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Dusan Knop, Martin Koutecky, and Matthias Mnich. Combinatorial n-fold Integer Programming and Applications. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 54:1-54:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{knop_et_al:LIPIcs.ESA.2017.54, author = {Knop, Dusan and Koutecky, Martin and Mnich, Matthias}, title = {{Combinatorial n-fold Integer Programming and Applications}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.54}, URN = {urn:nbn:de:0030-drops-78616}, doi = {10.4230/LIPIcs.ESA.2017.54}, annote = {Keywords: integer programming, closest strings, fixed-parameter algorithms} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Josh Alman, Matthias Mnich, and Virginia Vassilevska Williams. Dynamic Parameterized Problems and Algorithms. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{alman_et_al:LIPIcs.ICALP.2017.41, author = {Alman, Josh and Mnich, Matthias and Vassilevska Williams, Virginia}, title = {{Dynamic Parameterized Problems and Algorithms}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.41}, URN = {urn:nbn:de:0030-drops-74419}, doi = {10.4230/LIPIcs.ICALP.2017.41}, annote = {Keywords: Dynamic algorithms, fixed-parameter algorithms} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Dusan Knop, Martin Koutecký, and Matthias Mnich. Voting and Bribing in Single-Exponential Time. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 46:1-46:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{knop_et_al:LIPIcs.STACS.2017.46, author = {Knop, Dusan and Kouteck\'{y}, Martin and Mnich, Matthias}, title = {{Voting and Bribing in Single-Exponential Time}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {46:1--46:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.46}, URN = {urn:nbn:de:0030-drops-69885}, doi = {10.4230/LIPIcs.STACS.2017.46}, annote = {Keywords: Parameterized algorithm, swap bribery, n-fold integer programming} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Matthias Mnich and Eva-Lotta Teutrine. Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 24:1-24:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{mnich_et_al:LIPIcs.IPEC.2016.24, author = {Mnich, Matthias and Teutrine, Eva-Lotta}, title = {{Improved Bounds for Minimal Feedback Vertex Sets in Tournaments}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {24:1--24:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.24}, URN = {urn:nbn:de:0030-drops-69236}, doi = {10.4230/LIPIcs.IPEC.2016.24}, annote = {Keywords: exponential-time algorithms, feedback vertex sets, tournaments} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Michael Etscheid and Matthias Mnich. Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 31:1-31:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{etscheid_et_al:LIPIcs.ISAAC.2016.31, author = {Etscheid, Michael and Mnich, Matthias}, title = {{Linear Kernels and Linear-Time Algorithms for Finding Large Cuts}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {31:1--31:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.31}, URN = {urn:nbn:de:0030-drops-68016}, doi = {10.4230/LIPIcs.ISAAC.2016.31}, annote = {Keywords: Max-Cut, fixed-parameter tractability, kernelization} }
Feedback for Dagstuhl Publishing